Pages that link to "Item:Q2563889"
From MaRDI portal
The following pages link to A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889):
Displaying 8 items.
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851) (← links)
- Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)
