Pages that link to "Item:Q4287604"
From MaRDI portal
The following pages link to New Lower and Upper Bounds for Scheduling Around a Small Common Due Date (Q4287604):
Displayed 14 items.
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
- Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine (Q1290647) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
- Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281) (← links)
- Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties (Q5936755) (← links)
- Single machine weighted earliness-tardiness penalty problem with a common due date (Q5939971) (← links)
- Parallel machine scheduling with a common due window (Q5953340) (← links)