Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

DOI10.1016/j.cor.2006.03.021zbMath1141.90018OpenAlexW2134561741WikidataQ57387748 ScholiaQ57387748MaRDI QIDQ2384909

Małgorzata Sterna, Frank Werner, Erwin Pesch, Jacek Błażewicz

Publication date: 10 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.021

zbMATH Keywords

simulated annealingtabu searchSchedulingmetaheuristicvariable neighborhood searchflow-shoplate work criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Two-machine flow-shop scheduling to minimize total late work: revisited, On the exact solution of the no-wait flow shop problem with due date constraints, Solving the unconstrained optimization problem by a variable neighborhood search, Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work, Scheduling on parallel identical machines with late work criterion: offline and online cases, Variable neighbourhood search: methods and applications, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility, Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date, Variable neighbourhood search: Methods and applications, Two-machine flow shop scheduling with a common due date to maximize total early work

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Minimizing mean weighted execution time loss on identical and uniform processors
• Minimizing the number of tardy job units under release time constraints
• A survey of priority rule-based scheduling
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing the weighted number of tardy task units
• Open shop scheduling problems with late work criteria.
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Designing and reporting on computational experiments with heuristic methods
• Testing heuristics: We have it all wrong
• Optimal two- and three-stage production schedules with setup times included
• Single Machine Scheduling to Minimize Total Late Work
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• Single Machine Scheduling to Minimize Total Weighted Late Work