Scheduling parallel-machine batch operations to maximize on-time delivery performance

DOI10.1007/s10951-015-0449-6zbMath1353.90068OpenAlexW2192837677MaRDI QIDQ341468

Shubin Xu, James C. Bean

Publication date: 16 November 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0449-6

zbMATH Keywords

genetic algorithmsbatchingoptimal algorithmapproximate algorithmsparallel-machine schedulingtotal weighted tardinessnonlinear relaxation

Mathematics Subject Classification ID

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 (3)

Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Integrated scheduling of production and distribution for manufacturers with parallel batching facilities ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• AMPL
• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A random-key genetic algorithm for the generalized traveling salesman problem
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
• A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
• A random key based genetic algorithm for the resource constrained project scheduling problem
• Scheduling a batching machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Genetic algorithms and tabu search: Hybrids for optimization
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Scheduling flexible flow lines with sequence-dependent setup times
• Scheduling with batching: A review
• Minimizing total completion time on a batch processing machine with job families
• A hybrid genetic algorithm for the job shop scheduling problem
• Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints
• The Batch Loading and Scheduling Problem
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A genetic algorithm methodology for complex scheduling problems
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Feature Article—Genetic Algorithms for the Operations Researcher
• A Genetic Algorithm for the Multiple-Choice Integer Program
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
• Nonlinear Programming
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: Scheduling parallel-machine batch operations to maximize on-time delivery performance