 On three-machine flow shop scheduling with deteriorating jobsLing Wang, Lin-Yan Sun, Lin-Hui Sun and Ji-Bo Wang International Journal of Production Economics, 2010, vol. 125, issue 1, 185-189 Abstract: In this paper, we consider a three-machine permutation flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that the processing time of a job is a simple linear function of its execution start time. The objective is to find a sequence that minimizes makespan. This problem is well known NP-hard. Optimal schedules are obtained for some special cases. For the general case, several dominance properties and two lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. Moreover, a heuristic algorithm is proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational experiments on randomly generated problems is conducted to evaluate the branch-and-bound algorithm and heuristic algorithm. The analysis shows that the proposed heuristic algorithm performs effectively and efficiently. Keywords: Scheduling; Flow; shop; Simple; linear; deterioration; Makespan; Branch-and-bound; algorithm; Heuristic; algorithm (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:125:y:2010:i:1:p:185-189 Access Statistics for this article International Journal of Production Economics is currently edited by Stefan Minner More articles in International Journal of Production Economics from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.