Cyclic flow-shop scheduling with no-wait constraints and missing operations

Czeslaw Smutnicki, Jaroslaw Pempera, Grzegorz Bocewicz and Zbigniew Banaszak

European Journal of Operational Research, 2022, vol. 302, issue 1, 39-49

Abstract: The paper deals with a problem of seeking the cyclic schedule with minimal cycle time criterion in a manufacturing system based on the flow of various jobs with identical technological routes, no-wait constraints and some operations missing. We decompose the problem into two sub-problems: finding the minimal cycle time for the given processing order of jobs and finding the optimal processing order of jobs. For the former sub-problem we provide a few alternative methods and analyze their computational complexity. The latter sub-problem is solved by using a metaheuristic. The efficiency and quality of the proposed algorithm were examined experimentally.

Keywords: Scheduling; Cycle time; Algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722172101105X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:302:y:2022:i:1:p:39-49

DOI: 10.1016/j.ejor.2021.12.049

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().