Pages that link to "Item:Q4205231"
From MaRDI portal
The following pages link to On the Complexity of Scheduling with Batch Setup Times (Q4205231):
Displayed 50 items.
- On-line scheduling with setup costs (Q294721) (← links)
- Scheduling with few changes (Q299829) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem (Q398915) (← links)
- Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- The coordination of scheduling and batch deliveries (Q816348) (← links)
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543) (← links)
- The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard (Q856324) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan (Q880565) (← links)
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
- Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
- A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384) (← links)
- MILP-based campaign scheduling in a specialty chemicals plant: a case study (Q1017962) (← links)
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times (Q1179195) (← links)
- Scheduling two job classes on a single machine (Q1186919) (← links)
- A heuristic for preemptive scheduling with set-up times (Q1202243) (← links)
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534) (← links)
- Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
- Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
- One-machine batching and sequencing of multiple-type items (Q1332828) (← links)
- Scheduling of multi-spindle CNC gantry mills (Q1347599) (← links)
- Batch scheduling to minimize maximum lateness (Q1373461) (← links)
- The complexity of scheduling job families about a common due date (Q1376265) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Minimizing maximum lateness with job families (Q1590808) (← links)
- List scheduling in a parallel machine environment with precedence constraints and setup times (Q1604056) (← links)
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← 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)
- Two-machine shop scheduling problems with batch processing (Q1802481) (← links)
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
- Batch scheduling to minimize total completion time (Q1890951) (← links)
- A sequencing problem with family setup times (Q1917311) (← links)
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)