Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
From MaRDI portal
Publication:1652207
DOI10.1016/j.cor.2016.12.001zbMath1391.90302OpenAlexW2557704169MaRDI QIDQ1652207
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.001
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (9)
Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Just-in-time single-batch-processing machine scheduling ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ The job shop scheduling problem with convex costs ⋮ 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 ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Split-merge: using exponential neighborhood search for scheduling a batching machine
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Scheduling a batching machine
- Makespan minimization on single batch-processing machine via ant colony optimization
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Earliness and tardiness scheduling problems on a batch processor
- Scheduling with batching: A review
- Solving single batch-processing machine problems using an iterated heuristic
- Single- and multiple-processor models for minimizing completion time variance
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Single batch machine scheduling with deliveries
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
