Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria

Authors:
Vincent T'kindt;Federico Della Croce;Jean-Louis Bouquard
Affiliations:
Laboratory of Computer Science, University of Tours, 64 Avenue Jean Portalis, 37200 Tours, France;Departimento di Automatica ed Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Laboratory of Computer Science, University of Tours, 64 Av. J. Portalis, 37200 Tours, France
Venue:
INFORMS Journal on Computing
Year:
2007

Citing 4
Cited 2

Algorithms for scheduling a single machine to minimize the weighted number of late jobs

Management Science
Flowshop scheduling with dominant machines

Computers and Operations Research
A Computational Study of Search Strategies for Mixed Integer Programming

INFORMS Journal on Computing
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

Journal of Scheduling
A survey on offline scheduling with rejection

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a two-machine flowshop-scheduling problem with an unknown common due date where the objective is minimization of both the number of tardy jobs and the unknown common due date. We show that the problem is NP-hard in the ordinary sense and present a pseudopolynomial dynamic program for its solution. Then, we propose an exact ε-constraint approach based on the optimal solution of a related single-machine problem. For this latter problem a compact ILP formulation is explored: a powerful variable-fixing technique is presented and several logic cuts are considered. Computational results indicate that, with the proposed approach, the pareto optima can be computed, in reasonable time, for instances with up to 500 jobs.