 Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicityDjedjiga Ouiddir, Mourad Boudhar and Karima Bouibede-Hocine International Journal of Mathematics in Operational Research, 2023, vol. 24, issue 4, 510-536 Abstract: This work addresses a just-in-time (JiT) scheduling problem on two-machine flow shop. We consider the case where each order (job) is composed of several pieces with sequence-dependent setup times. This scheduling problem involves the reducing waste, inventory costs and making goods available as and when needed. Here, the jobs incur either penalties or storage costs if they are not completed within their specific due dates. The aim is to obtain a sequence which minimises two criteria: the total weighted earliness and the total weighted tardiness. For the resolution of this problem, we propose a linear mathematical model, three heuristics and two meta-heuristics, the fast and elitist multi-objective genetic algorithm (NSGA-II) and the multi-objective tabu search algorithm (MOTS). The computational experiments, presented and discussed on randomly generated instances, are showed the effectiveness of the proposed model and NSGA-II. Keywords: flow shop; just-in-time; JiT; pieces multiplicity; multi-criteria; mixed integer linear programming; MILP; meta-heuristics. (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:ids:ijmore:v:24:y:2023:i:4:p:510-536 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
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.