The Batch Loading and Scheduling Problem
From MaRDI portal
Publication:3634981
DOI10.1287/opre.49.1.52.11189zbMath1163.90486OpenAlexW2114338779MaRDI QIDQ3634981
Ramakrishnan S. Nambimadom, Gregory Dobson
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1802/4812
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (41)
Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom ⋮ Minimizing makespan with multiple-orders-per-job in a two-machine flowshop ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing ⋮ Parallel batching with multi-size jobs and incompatible job families ⋮ Improved analysis of two algorithms for min-weighted sum bin packing ⋮ Batch machine production with perishability time windows and limited batch size ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem ⋮ Multiple orders per job batch scheduling with incompatible jobs ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Adaptive scheduling of batch servers in flow shops ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart
This page was built for publication: The Batch Loading and Scheduling Problem
