Pages that link to "Item:Q1600949"
From MaRDI portal
The following pages link to A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949):
Displayed 36 items.
- On scheduling around large restrictive common due windows (Q704121) (← links)
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- A mixed integer programming model for advanced planning and scheduling (APS) (Q872302) (← links)
- Order acceptance with weighted tardiness (Q878579) (← links)
- Single-machine scheduling against due dates with past-sequence-dependent setup times (Q933538) (← links)
- Group sequencing around a common due date (Q937402) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- A note: Common due date assignment for a single machine scheduling with the rate-modifying activity (Q954028) (← links)
- Skilled workforce scheduling in service centres (Q954927) (← links)
- Minmax scheduling problems with a common due-window (Q1000973) (← links)
- A multi-criteria scheduling with due-window assignment problem (Q1007672) (← links)
- A note on a due-date assignment on a two-machine flow-shop (Q1765554) (← links)
- Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
- Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
- Common due date scheduling with autonomous and induced learning (Q1887957) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Improving delivery reliability by a new due-date setting rule (Q2426550) (← links)
- Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Real-time prediction of order flowtimes using support vector regression (Q2483499) (← links)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
- A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
- Due-date assignment on uniform machines (Q2519077) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- Scheduling in supply chain environment (Q2643925) (← links)
- Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine (Q2773167) (← links)
- Single machine due-date scheduling of jobs with decreasing start-time dependent processing times (Q3025050) (← links)
- Boundary Labeling with Octilinear Leaders (Q3512462) (← links)
- Real-time due-date promising by build-to-order environments (Q4671325) (← links)