Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
From MaRDI portal
Publication:2892311
DOI10.1287/ijoc.1050.0167zbMath1241.90058OpenAlexW4300238461MaRDI QIDQ2892311
Jean-Louis Bouquard, Vincent T'kindt, Frederico Della Croce
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1050.0167
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ A survey on offline scheduling with rejection ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ A constraint generation approach for two-machine shop problems with jobs selection ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Moderate exponential-time algorithms for scheduling problems ⋮ On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
This page was built for publication: Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
