Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity Online publication date: Wed, 05-Apr-2023
by Djedjiga Ouiddir; Mourad Boudhar; Karima Bouibede-Hocine
International Journal of Mathematics in Operational Research (IJMOR), Vol. 24, No. 4, 2023
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook