Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem

Recommendations

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Minimizing mean absolute deviation of completion times about a common due date
Two-machine flow shop scheduling with nonregular criteria
The two-machine flowshop scheduling problem with total tardiness
Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling

Cites work

A V-shape property of optimal schedule of jobs about a common due date
A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
Minimizing mean absolute deviation of completion times about a common due date
Minimizing the average deviation of job completion times about a common due date
Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
On two-machine scheduling with release and due dates to minimize maximum lateness
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
Optimal two- and three-stage production schedules with set-up time included
Scheduling about a common due date with earliness and tardiness penalties
Scheduling problems with non-regular penalty functions - a review
Sequencing with Earliness and Tardiness Penalties: A Review
Single machine scheduling to minimize mean absolute lateness: A heuristic solution
Single-machine scheduling to minimize absolute deviation of completion times from a common due date
Some new results in flow shop scheduling
The Single Machine Early/Tardy Problem
Two-Stage Flowshop Scheduling Problem with Bicriteria

Cited in

(12)

Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
A survey of the state-of-the-art of common due date assignment and scheduling research
A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
On the exact solution of the no-wait flow shop problem with due date constraints
Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem

Describes a project that uses

Uses Software

LINDO

This page was built for publication: Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem

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