Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
DOI10.1016/0307-904X(94)00022-XzbMATH Open0829.90075OpenAlexW2011247778WikidataQ127975656 ScholiaQ127975656MaRDI QIDQ1893607FDOQ1893607
Authors: Hüseyin Sarper
Publication date: 4 July 1995
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0307-904x(94)00022-x
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
mixed integer programmingtwo-machine flow shopcommon due datejob completion timesminimization of the sum of absolute deviations
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Sequencing with Earliness and Tardiness Penalties: A Review
- Some new results in flow shop scheduling
- The Single Machine Early/Tardy Problem
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- 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
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Scheduling about a common due date with earliness and tardiness penalties
- A V-shape property of optimal schedule of jobs about a common due date
- Scheduling problems with non-regular penalty functions - a review
- 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
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
Uses Software
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)