Pages that link to "Item:Q1291766"
From MaRDI portal
The following pages link to Scheduling under a common due-date on parallel unrelated machines (Q1291766):
Displaying 12 items.
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
- A production rescheduling expert simulation system (Q1577764) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- Hierarchical production planning and scheduling in a multi-product, batch process environment (Q5444475) (← links)
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties (Q5936755) (← links)
- Parallel machine scheduling with a common due window (Q5953340) (← links)
- Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling (Q6613982) (← links)
