Pages that link to "Item:Q4131996"
From MaRDI portal
The following pages link to A dual algorithm for the one-machine scheduling problem (Q4131996):
Displaying 16 items.
- Integration of finished goods batch delivery into production scheduling via total tardiness minimization (Q3512025) (← links)
- A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- A bicriterion scheduling problem involving total flowtime and total tardiness (Q4264495) (← links)
- A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161) (← links)
- Two-machine flowshop scheduling to minimize total tardiness (Q4352599) (← links)
- Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm (Q4469135) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4474722) (← links)
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (Q4717402) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4823493) (← links)
- A heuristic approach to bicriteria scheduling (Q4934193) (← links)
- A heuristic approach for single-machine scheduling with due dates and class setups. (Q5945318) (← links)
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation (Q5955791) (← links)
- Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization (Q6619608) (← links)
