Pages that link to "Item:Q947941"
From MaRDI portal
The following pages link to Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941):
Displaying 11 items.
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
- Minmax due-date assignment on a two-machine flowshop (Q2241579) (← 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)
- Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling (Q4319493) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)
