Pages that link to "Item:Q336376"
From MaRDI portal
The following pages link to Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376):
Displaying 13 items.
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- The single machine weighted mean squared deviation problem (Q1753598) (← links)
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem (Q1761154) (← links)
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties (Q2483517) (← links)
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times (Q6094376) (← links)
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment (Q6535663) (← links)
