Pages that link to "Item:Q1890951"
From MaRDI portal
The following pages link to Batch scheduling to minimize total completion time (Q1890951):
Displaying 16 items.
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
- Batch scheduling to minimize maximum lateness (Q1373461) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Robust scheduling on a single machine to minimize total flow time (Q1762157) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Scheduling the production of two-component jobs on a single machine (Q1969827) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
