Scheduling with batching: A review

DOI10.1016/S0377-2217(99)00153-8zbMath0953.90028MaRDI QIDQ1969826

Chris N. Potts, Mikhail Y. Kovalyov

Publication date: 30 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

complexity; scheduling; dynamic programming; approximation; batching decisions

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan, Batching decisions for assembly production systems, Single machine group scheduling with resource dependent setup and processing times, Single machine batch scheduling with release times, Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date, The coordination of scheduling and batch deliveries, Single machine batch scheduling to minimize total completion time and resource consumption costs, Batch scheduling of step deteriorating jobs, On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs, A hybrid two-stage transportation and batch scheduling problem, Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration, Single machine scheduling with batch-dependent setup times, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Makespan minimization in a no-wait flow shop problem with two batching machines, Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, Scheduling a hybrid flowshop with batch production at the last stage, Minimizing makespan with multiple-orders-per-job in a two-machine flowshop, Single machine batch scheduling problem with family setup times and release dates to minimize makespan, Time slot scheduling of compatible jobs, Single processor scheduling with job values depending on their completion times, Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date, Batching deteriorating items with applications in computer communication and reverse logistics, Group sequencing around a common due date, Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem, Fuzzy job shop scheduling with lot-sizing, Scheduling at coal handling facilities using simulated annealing, Minimizing makespan for multi-spindle head machines with a mobile table, Flowshop scheduling problem with a batching machine and task compatibilities, Batching and scheduling in a multi-machine flow shop, Production scheduling with supply and delivery considerations to minimize the makespan, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Single machine parallel-batch scheduling with deteriorating jobs, Scheduling reentrant jobs on parallel machines with a remote server, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, A simulated annealing algorithm for single machine scheduling problems with family setups, An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan, A new heuristic algorithm for the machine scheduling problem with job delivery coordination, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, Scheduling with families of jobs and delivery coordination under job availability, Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, Scheduling incompatible tasks on two machines, On-line integrated production-distribution scheduling problems with capacitated deliveries, Single machine batch scheduling with jointly compressible setup and processing times., Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times., Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches., Parallel machine batching and scheduling with deadlines, Improved dynamic programs for some batching problems involving the maximum lateness criterion, Heuristic methods for the identical parallel machine flowtime problem with set-up times, Two-machine flowshop batching and scheduling, Group scheduling with controllable setup and processing times: minimizing total weighted completion time, Order consolidation for batch processing, Two-machine flowshop scheduling with job class setups to minimize total flowtime, On-line scheduling algorithms for a batch machine with finite capacity, A polynomial algorithm for lot-size scheduling of two type tasks., The complexity of two group scheduling problems, Scheduling parallel dedicated machines under a single non-shared resource, On scheduling an unbounded batch machine, Machine scheduling with job delivery coordination, A note on flow-shop and job-shop batch scheduling with identical processing-time jobs, A cyclic approach to large-scale short-term planning in chemical batch production, Minimizing the makespan on a single parallel batching machine, A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs, Improved MILP models for two-machine flowshop with batch processing machines, Minimizing makespan in a two-machine flowshop scheduling with batching and release time, A note on special optimal batching structures to minimize total weighted completion time, Application of an optimization problem in max-plus algebra to scheduling problems, Lot sizing and furnace scheduling in small foundries, Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline, Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs, A survey of scheduling problems with setup times or costs, Single-machine scheduling problems with past-sequence-dependent setup times, A single machine batch scheduling problem with bounded batch size, Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times, Open-shop batch scheduling with identical jobs, Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups, A queueing model for a two-stage stochastic manufacturing system with overlapping operations, Batch processing with interval graph compatibilities between tasks, Approximation algorithms for problems in scheduling with set-ups, A bi-objective coordination setup problem in a two-stage production system, Batch scheduling of deteriorating reworkables, On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan, A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines, Mixed integer formulation to minimize makespan in a flow shop with batch processing machines, Minimizing flow-time on a single machine with integer batch sizes, Batch scheduling in a two-level supply chain -- a focus on the supplier, A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, Two-machine shop scheduling: Compromise between flexibility and makespan value, Flowshop scheduling research after five decades, On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes, Scheduling on a batch processing machine with split compatibility graphs, A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups, Approximations and auctions for scheduling batches on related machines, A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems, Machine scheduling with job class setup and delivery considerations, On Minimizing Total Tardiness in a Serial Batching Problem, One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective, MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES, Lot-Sizing and Sequencing on a Single Imperfect Machine, Scheduling multiple products on parallel machines with setup costs, Dynamic scheduling of batch servers with compatible product families, Scheduling with product family set-up times: an application in TFT LCD manufacturing, Adaptive scheduling of batch servers in flow shops, Scheduling the production of rolling ingots: industrial context, model, and solution method, Transfer batch scheduling using genetic algorithms, Single machine group scheduling with family setups to minimize total tardiness, Influence of capacity- and time-constrained intermediate storage in two-stage food production systems, STOCHASTIC BATCH SCHEDULING AND THE “SMALLEST VARIANCE FIRST” RULE, Dynamic scheduling of batch-processing machines with non-identical product sizes, Scheduling batches with simultaneous job processing for two-machine shop problems, Batch scheduling in the no-wait two-machine flowshop to minimize the makespan, A note on the complexity of family scheduling to minimize the number of late jobs, Single machine batch scheduling with resource dependent setup and processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Batch sizing and job sequencing on a single machine
• Single facility multi-class job scheduling
• Batching in single operation manufacturing systems
• Single facility scheduling with multiple job classes
• A polynomial algorithm for a one machine batching problem
• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
• Scheduling a batching machine
• Batch scheduling with deadlines on parallel machines
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
• Single machine scheduling with batch deliveries
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
• Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
• The complexity of one-machine batching problems
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
• One-machine batching and sequencing of multiple-type items
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Batch scheduling to minimize maximum lateness
• Single facility scheduling with major and minor setups
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• The complexity of scheduling job families about a common due date
• Batch scheduling and common due date assignment problem: An NP-hard case
• Two-machine shop scheduling problems with batch processing
• Heuristics for permutation flow shop scheduling with batch setup times
• Batch scheduling to minimize total completion time
• Scheduling multi-operation jobs on a single machine
• Scheduling the production of two-component jobs on a single machine
• Minimizing total completion time on a batch processing machine with job families
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
• Batch scheduling and common due-date assignment on a single machine
• Scheduling with Deadlines and Loss Functions
• Note on “Parallel Machine Scheduling with Batch Setup Times”
• Optimal two- and three-stage production schedules with setup times included
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• Batching to Minimize Flow Times on One Machine
• One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Complexity of Scheduling with Batch Setup Times
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Parallel Machine Scheduling with Batch Setup Times
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• Solving a Class Scheduling Problem with a Genetic Algorithm
• Scheduling Groups of Jobs on a Single Machine
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Scheduling batches with simultaneous job processing for two-machine shop problems