An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines

• Published in: European journal of operational research Vol. 221; no. 1; pp. 7 - 13
• Main Authors: Panwalkar, S.S., Koulamas, Christos
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 16.08.2012; Elsevier; Elsevier Sequoia S.A
• Subjects: Algorithms; Applied sciences; Due dates; Exact sciences and technology; Flow shop; Inventory control, production control. Distribution; Job shops; Machine shops; Mathematical problems; Multi-criteria problems; Operational research; Operational research and scientific management; Operational research. Management science; Operations research; Production scheduling; Scheduling; Scheduling algorithms; Studies; Multi-criteria problems; Scheduling; Flow shop; Production management; Multiple machine; Multicriteria analysis; NP hard problem; Processing time; Due date; Execution time
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2012.02.020

► We consider an assignable common due date minimal number of tardy jobs problem. ► We then consider the two-machine flow shop case with ordered machines. ► We present an O(n2) algorithm for this special case. ► We also apply our algorithm to the similar problem with a given common due date. We consider the ordinary NP- hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. We present an O(n2) algorithm for the problem when the machines are ordered, that is, when each job has its smaller processing time on the first (second) machine. We also discuss the applicability of the proposed algorithm to the corresponding single-objective problem in which the common due date is given.