Scheduling a single batch processing machine with non-identical job sizes
From MaRDI portal
Publication:4394297
DOI10.1080/00207549408957026zbMath0906.90095OpenAlexW2048631059MaRDI QIDQ4394297
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
Related Items (only showing first 100 items - show all)
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 ⋮ Minimizing due date related performance measures on two batch processing machines ⋮ The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Integrated production and transportation on parallel batch machines to minimize total weighted delivery time ⋮ 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 ⋮ 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 ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ 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 ⋮ Improved MILP models for two-machine flowshop with batch processing machines ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ 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 ⋮ Integrated scheduling problem on a single bounded batch machine with an unavailability constraint ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Minimizing makespan with multiple-orders-per-job in a two-machine flowshop ⋮ 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 ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ 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-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 ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Exact methods for the oven scheduling problem ⋮ Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches ⋮ Bin Packing Problem with Time Lags ⋮ Approximation schemes for scheduling a batching machine with nonidentical job size ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Mixed batch scheduling on identical machines ⋮ Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ Batch-size-based rearrangement of the shop floor into mini-lines ⋮ A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines ⋮ A bi-criteria optimization model for medical device sterilization ⋮ Scheduling batch processing machine using max-min ant system algorithm improved by a local search method ⋮ The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan ⋮ 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 ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ Frameworks for adaptable scheduling algorithms ⋮ 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 ⋮ A particle swarm optimizer for grouping problems ⋮ 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 ⋮ An optimization model for freight transport using urban rail transit ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ 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 ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ 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 ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ Grouping evolution strategies: an effective approach for grouping problems ⋮ Scheduling batch processing machines with incompatible job families ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with 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 ⋮ Minimizing the makespan on a single parallel batching machine ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan ⋮ Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ Column generation for minimizing total completion time in a parallel-batching environment ⋮ A note on minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Minimizing makespan on a single burn-in oven in semiconductor manufacturing ⋮ 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
Cites Work
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing total completion time on a batch processing machine with job families
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Scheduling independent tasks to reduce mean finishing time
This page was built for publication: Scheduling a single batch processing machine with non-identical job sizes
