 Flow shop scheduling with jobs arriving at different timesGuo Li, Na Li, Narayanasamy Sambandam, Suresh Sethi and Faping Zhang International Journal of Production Economics, 2018, vol. 206, issue C, 250-260 Abstract: Flow shop scheduling is common in modern lean production systems. In practice, jobs in flow shops can arrive at irregular times. However, scheduling that considers such irregularity has not been adequately investigated in the literature. In this paper, we examine the scheduling of n-jobs in an m-machine permutation flow shop with an unlimited intermediate storage. The jobs in this shop are assumed to have deterministic and known occurrence times. The objective of this scheduling is to reduce the total completion time (Fm|prmu|∑Cj). To improve the quality of solution, we successively put each job in the current best position and reinsert certain jobs based on weight calculations. We then develop and compare the solutions obtained by our simple and constructive heuristic method against the optimal schedules or other simple heuristic solutions with and without jobs arriving at different times. The computational experiments highlight the efficiency, easy implementation, and excellent performance of our proposed heuristic method. Keywords: Flow shop; Scheduling; Heuristic methods; Different times; Lean production (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:206:y:2018:i:c:p:250-260 DOI: 10.1016/j.ijpe.2018.10.010 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.