The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 28-256
Full Name: Ali Kargarnejad
Position: Assistant Professor
Age: ON
Sex: Male
Address: No.29, 18 TH St., North- Kargar St., Tehran, Iran
Country: IRAN
Tel: +982122729110
Tel prefix:
Fax:
E-mail address: az_micro@yahoo.com
Other E-mails: kargarnejad@azad.ac.ir
Title of the Paper: novel job based and machine based lower bound on makespan in jobshop scheduling problem
Authors as they appear in the Paper: Ali Kargarnejad , Mehdi Maneshi , Shardad Ezzatdoust
Email addresses of all the authors: kargarnejad@azad.ac.ir , m_maneshi@azad.ac.ir , sh_ezzatdoust@azad.ac.ir
Number of paper pages: 10
Abstract: In this paper, two new lower boundaries named Extended Machine-Based Lower Bound and Extended Job-Based Lower Bound on Jobshop scheduling problem with objective makespan function are being issued. In order to calculate the extended low boundaries, situations are being considered in which, that processing of operations by machine, is not possible. With making use of the given low boundaries, better estimation relative to optimized response can be obtained. No matter how much the low boundary is close to the real optimized boundary, the evaluation of obtained results from different algorithms will be carried out with more precision. Low Extended boundaries were computed on 80 available test problems. After computing extended low boundaries, they are compared with available boundaries; results show that on 55 percent of the available results cases had development relative to previous results.
Keywords: Jobshop, Scheduling, NP-hard problem, Makespan, Job-Based Lower Bound, Machine-Based Lower Bound
EXTENSION of the file: .doc
Special (Invited) Session: novel job based and machine based lower bound on makespan in jobshop scheduling problem
Organizer of the Session: 594-573
How Did you learn about congress:
IP ADDRESS: 91.98.135.42
