Pages that link to "Item:Q1893607"
From MaRDI portal
The following pages link to Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607):
Displaying 11 items.
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← links)
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
- 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 (Q2337385) (← links)
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs (Q5305562) (← links)
