Minimizing makespan on a single batch processing machine with dynamic job arrivals
From MaRDI portal
Publication:4245414
DOI10.1080/002075499192020zbMath0939.90537OpenAlexW2021261368MaRDI QIDQ4245414
Publication date: 8 June 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075499192020
Related Items (82)
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Approximation algorithms for batch scheduling with processing set restrictions ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Mixed batch scheduling on identical machines ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time ⋮ An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times ⋮ An improved on-line algorithm for single parallel-batch machine scheduling with delivery times ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan ⋮ The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan ⋮ Learning effective dispatching rules for batch processor scheduling ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan ⋮ A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ Minimizing makespan on a single batching machine with release times and non-identical job sizes ⋮ Minimizing number of tardy jobs on a batch processing machine with incompatible job families ⋮ Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families ⋮ A survey of dynamic scheduling in manufacturing systems ⋮ Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan ⋮ Minimizing makespan with release times on identical parallel batching machines ⋮ Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes ⋮ On-line scheduling algorithms for a batch machine with finite capacity ⋮ Optimal online-list batch scheduling ⋮ Online scheduling on unbounded parallel-batch machines to minimize the makespan ⋮ Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times ⋮ Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Adaptive scheduling of batch servers in flow shops ⋮ Bounded single-machine parallel-batch scheduling with release dates and rejection ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ On-line scheduling with delivery time on a single batch machine ⋮ Online scheduling in a parallel batch processing system to minimize makespan using restarts ⋮ THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ A PTAS for parallel batch scheduling with rejection and dynamic job arrivals ⋮ Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Scheduling one batch processor subject to job release dates ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ 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 ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times ⋮ Online unbounded batch scheduling on parallel machines with delivery times ⋮ On scheduling an unbounded batch machine
This page was built for publication: Minimizing makespan on a single batch processing machine with dynamic job arrivals
