Scheduling a single batch processing machine with non-identical job sizes

DOI10.1080/00207549408957026MaRDI QIDQ4394297zbMATH OpenOpenAlexFDO

Authors Reha Uzsoy

Publication date 11 June 1998

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207549408957026

zbMATH Keywords

branch-and-boundheuristicsNP-hardtotal completion time

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Scheduling parallel batch processing machines with non-identical job sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Scheduling a batch processing machine with non-identical job sizes

Cites work

• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Efficient scheduling algorithms for a single batch processing machine
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• Minimizing total completion time on a batch processing machine with job families
• Scheduling independent tasks to reduce mean finishing time
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(only showing first 100 items - show all)

• An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• A new dynamic look-ahead scheduling procedure for batching machines
• Integrated production and transportation on parallel batch machines to minimize total weighted delivery time
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Integrated scheduling on a batch machine to minimize production, inventory and distribution costs
• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
• Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
• An optimization model for freight transport using urban rail transit
• Makespan minimization on single batch-processing machine via ant colony optimization
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• On-line scheduling algorithms for a batch machine with finite capacity
• Minimizing due date related performance measures on two batch processing machines
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Frameworks for adaptable scheduling algorithms
• Grouping evolution strategies: an effective approach for grouping problems
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
• Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs
• Number of bins and maximum lateness minimization in two-dimensional bin packing
• Batch scheduling of nonidentical job sizes with minsum criteria
• Column generation for minimizing total completion time in a parallel-batching environment
• A survey of scheduling with parallel batch (p-batch) processing
• Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
• Exact algorithms to minimize makespan on single and parallel batch processing machines
• A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
• Mixed batch scheduling on identical machines
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• A bi-criteria optimization model for medical device sterilization
• Minimizing the makespan on a single parallel batching machine
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines
• Improved MILP models for two-machine flowshop with batch processing machines
• Approximation schemes for scheduling a batching machine with nonidentical job size
• MIP formulations and heuristics for solving parallel batching problems
• Integrated batch sizing and scheduling on a single machine
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• A solution framework for scheduling a BPM with non-identical job dimensions
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
• 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
• Arc-flow approach for single batch-processing machine scheduling
• Just-in-time single-batch-processing machine scheduling
• Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
• Batch-size-based rearrangement of the shop floor into mini-lines
• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• Solving single batch-processing machine problems using an iterated heuristic
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Integrated production and delivery on parallel batching machines
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
• Scheduling parallel-machine batch operations to maximize on-time delivery performance
• Scheduling parallel batch processing machines with non-identical job sizes
• Heuristic scheduling of jobs on a multi-product batch processing machine
• Scheduling batch processing machines with incompatible job families
• Scheduling a batch processing machine with non-identical job sizes
• The bounded batch scheduling with common due window and non-identical size jobs
• Dynamic scheduling of batch servers with compatible product families
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm
• A particle swarm optimizer for grouping problems
• Integrated scheduling on parallel batch processing machines with non-identical capacities
• Exact approaches for single machine total weighted tardiness batch scheduling
• Bin Packing Problem with Time Lags
• A coordination mechanism for a scheduling game with parallel-batching machines
• Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations
• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
• Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching
• Dynamic scheduling of batch-processing machines with non-identical product sizes
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• 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
• Exact methods for the oven scheduling problem
• Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches
• A hybrid neural network approach to minimize total completion time on a single batch processing machine
• Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
• Parallel batching with multi-size jobs and incompatible job families
• Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
• Approximation algorithms for parallel batch machine scheduling of malleable jobs
• A new class of lower bounds for scheduling a batch processing machine to minimize makespan
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance

This page was built for publication: Scheduling a single batch processing machine with non-identical job sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394297)