Setting a common due date in a constrained flowshop: a variable neighbourhood search approach

Recommendations

Minimizing tardy jobs in a flowshop with common due date
A note on a due-date assignment on a two-machine flow-shop
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Cites work

scientific article; zbMATH DE number 7722 (Why is no real title available?)
scientific article; zbMATH DE number 702365 (Why is no real title available?)
scientific article; zbMATH DE number 2050711 (Why is no real title available?)
A comprehensive review and evaluation of permutation flowshop heuristics
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
Benchmarks for basic scheduling problems
Design and analysis of experiments.
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Parallel machines scheduling with nonsimultaneous machine available time
Rescheduling for New Orders
Rescheduling on a single machine with part-type dependent setup times and deadlines
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Scheduling in flowshops to minimize total tardiness of jobs
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Some efficient heuristic methods for the flow shop sequencing problem
Tabu search for total tardiness minimization in flowshop scheduling problems
The Complexity of Flowshop and Jobshop Scheduling
The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Variable neighborhood search
Variable neighborhood search: Principles and applications

Cited in

(2)

Variable neighbourhood structures for cycle location problems
A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems

Describes a project that uses

Uses Software

Genocop

This page was built for publication: Setting a common due date in a constrained flowshop: a variable neighbourhood search approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976037)