Efficient scheduling algorithms for a single batch processing machine
From MaRDI portal
Publication:1077325
DOI10.1016/0167-6377(86)90104-5zbMath0594.90045OpenAlexW2034279788MaRDI QIDQ1077325
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90104-5
Related Items
Minimizing due date related performance measures on two batch processing machines, Minimizing total completion time on a batch processing machine with job families, Minimizing total weighted tardiness on a single batch process machine with incompatible job families, A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times, A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes, Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration, Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals, Integrated scheduling on parallel batch processing machines with non-identical capacities, Integrated production and delivery on parallel batching machines, Scheduling unrelated parallel batch processing machines with non-identical job sizes, A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost, Parallel batch scheduling of equal-length jobs with release and due dates, Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems, Single batch machine scheduling with dual setup times for autoclave molding manufacturing, A constraint programming approach for a batch processing problem with non-identical job sizes, Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices, Mixed batch scheduling on identical machines, Parallel batching with multi-size jobs and incompatible job families, Realistic two-stage flowshop batch scheduling problems with transportation capacity and times, Batch machine production with perishability time windows and limited batch size, Unbounded parallel-batch scheduling with family jobs and delivery coordination, MIP formulations and heuristics for solving parallel batching problems, Co-scheduling algorithms for high-throughput workload execution, Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan, A bi-criteria optimization model for medical device sterilization, A two stage scheduling with transportation and batching, Earliness and tardiness scheduling problems on a batch processor, Scheduling batch processing machine using max-min ant system algorithm improved by a local search method, Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity, Learning effective dispatching rules for batch processor scheduling, A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines, The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs, A model for minimizing active processor time, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Bicriterion scheduling with equal processing times on a batch processing machine, Minimizing makespan on a single batch processing machine with nonidentical job sizes, Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes, 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, Scheduling a single batch processing machine with non-identical job sizes, Mixed integer formulation to minimize makespan in a flow shop with batch processing machines, Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date, Dynamic scheduling of batch servers with compatible product families, Scheduling batch processing machines with incompatible job families, 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 hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching, Dynamic scheduling of batch-processing machines with non-identical product sizes, 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, Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed, Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure, A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines, Revisit of the scheduling problems with integrated production and delivery on parallel batching machines, Scheduling a proportionate flow shop of batching machines, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines, Composing batches with yield uncertainty, Batch scheduling of nonidentical job sizes with minsum criteria, Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm, Scheduling jobs with agreeable processing times and due dates on a single batch processing machine, Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes, Scheduling jobs with release dates on parallel batch processing machines, Controlling job arrivals with processing time windows into batch processor buffer, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, Scheduling with agreeable release times and due dates on a batch processing machine, Scheduling with families of jobs and delivery coordination under job availability, A survey of scheduling with parallel batch (p-batch) processing, A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan, Minimizing makespan on a single burn-in oven in semiconductor manufacturing, Scheduling one batch processor subject to job release dates, 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, Heuristic scheduling of jobs on a multi-product batch processing machine, Scheduling on a batch processing machine with split compatibility graphs, A new dynamic look-ahead scheduling procedure for batching machines
Cites Work
