On the Complexity of Scheduling with Batch Setup Times
DOI10.1287/OPRE.37.5.798zbMATH Open0686.90025OpenAlexW2105390489MaRDI QIDQ4205231FDOQ4205231
Authors: Clyde l. Monma, Chris N. Potts
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.5.798
Recommendations
- Parallel Machine Scheduling with Batch Setup Times
- scientific article; zbMATH DE number 4085404
- Batch-processing scheduling with setup times
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
parallel machinestotal weighted completion timemaximum completion timebatch setup timespractical schedulingone-machine maximum lateness
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Cited In (95)
- Title not available (Why is that?)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- Single machine scheduling to minimize the setup time and the earliness
- A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Two-machine shop scheduling problems with batch processing
- A survey of job shop scheduling problem: the types and models
- Approximating weighted completion time for order scheduling with setup times
- Title not available (Why is that?)
- Analysis of batched service time data using Gaussian and semi-parametric kernel models
- Scheduling of multi-spindle CNC gantry mills
- Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues
- Parallel machine batching and scheduling with deadlines
- Scheduling with product family set-up times: an application in TFT LCD manufacturing
- A heuristic approach for single-machine scheduling with due dates and class setups.
- A note on the complexity of family scheduling to minimize the number of late jobs
- Parallel Machine Scheduling with Batch Setup Times
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
- Batch scheduling in a two-level supply chain -- a focus on the supplier
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- An online algorithm for a problem in scheduling with set-ups and release times
- Flow shop batching and scheduling with sequence-dependent setup times
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- An iterative approach for the serial batching problem with parallel machines and job families
- Unrelated parallel machine scheduling with new criteria: complexity and models
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- A sequencing problem with family setup times
- Batch scheduling and common due-date assignment on a single machine
- On the complexity of scheduling tasks with discrete starting times
- Minimizing maximum lateness with job families
- How to collect balls moving in the Euclidean plane
- Approximation algorithms for two-machine flow shop scheduling with batch setup times
- On-line scheduling with setup costs
- Scheduling with few changes
- The coordination of scheduling and batch deliveries
- Scheduling with batch setup times and earliness-tardiness penalties
- A heuristic for preemptive scheduling with set-up times
- The Batch Loading and Scheduling Problem
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Scheduling with batching: A review
- Machine scheduling with job class setup and delivery considerations
- Lot-sizing scheduling with batch setup times
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan
- Scheduling two job families on a single machine with two competitive agents
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
- Single machine group scheduling with family setups to minimize total tardiness
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
- Survey of scheduling research involving setup times
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
- MILP-based campaign scheduling in a specialty chemicals plant: a case study
- Approximation algorithms for problems in scheduling with set-ups
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
- Title not available (Why is that?)
- The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- Batch scheduling in a two-stage flexible flow shop problem
- A simulated annealing algorithm for single machine scheduling problems with family setups
- Batch machine production with perishability time windows and limited batch size
- Robust scheduling on a single machine to minimize total flow time
- A survey of scheduling problems with setup times or costs
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Finding optimal tour schedules on transportation paths under extended time window constraints
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem
- Minimizing L max for the single machine scheduling problem with family set-ups
- Solving the serial batching problem in job shop manufacturing systems
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Batch scheduling to minimize maximum lateness
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- One-machine batching and sequencing of multiple-type items
- Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
- The complexity of scheduling job families about a common due date
- Batch scheduling to minimize total completion time
- Scheduling two job classes on a single machine
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- On minimizing total tardiness in a serial batching problem
- Single-machine scheduling with advanced process control constraints
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Learning and forgetting effects on a group scheduling problem
- Scheduling job shop problems with sequence-dependent setup times
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
This page was built for publication: On the Complexity of Scheduling with Batch Setup Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205231)