Pages that link to "Item:Q2489364"
From MaRDI portal
The following pages link to Single machine scheduling with common due date and controllable processing times (Q2489364):
Displaying 14 items.
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
- Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
- A single machine scheduling problem with common due window and controllable processing times (Q1374426) (← links)
- Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814) (← links)
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance (Q1926630) (← links)
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- Single machine batch just-in-time scheduling problems with common batch size and common due date of jobs (Q2924306) (← links)
- (Q3131408) (← links)
- Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)
- Fabrication scheduling on a single machine with due date constraints (Q5955094) (← links)
