Pages that link to "Item:Q1098766"
From MaRDI portal
The following pages link to Minimizing the maximum deviation of job completion time about a common due-date (Q1098766):
Displaying 12 items.
- A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints (Q356114) (← links)
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
- A minimax job completion-time problem revisited (Q1104851) (← links)
- A note on ``Minimizing the maximum deviation of job completion time about a common due-date'' (Q1104852) (← links)
- Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
- Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
- Minmax due-date assignment on a two-machine flowshop (Q2241579) (← links)
- Minmax due-date assignment with a time window for acceptable lead-times (Q2449349) (← links)
- Minimizing mean absolute deviation of completion times about a common due date (Q3735428) (← links)
