Just-in-time single-batch-processing machine scheduling

DOI10.1016/J.COR.2021.105675MaRDI QIDQ2669787zbMATH OpenOpenAlexFDO

Authors Yu Yang, Feng Wu, Hongbin Zhang

Publication date 9 March 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2021.105675

zbMATH Keywords

heuristicsjust-in-timelower boundnon-identical due datessingle-batch-processing machine

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Single machine batch just-in-time scheduling problems with common batch size and common due date of jobs
• Batch sizing and just-in-time scheduling with common due date
• 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
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

Cites work

• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• A constraint programming approach for a batch processing problem with non-identical job sizes
• A polyhedral approach to single-machine scheduling problems.
• A time indexed formulation of non-preemptive single machine scheduling problems
• An improved earliness--tardiness timing algorithm
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
• Earliness and tardiness scheduling problems on a batch processor
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• Heuristic scheduling of jobs on a multi-product batch processing machine
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Makespan minimization on single batch-processing machine via ant colony optimization
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Minimizing the earliness--tardiness costs on a single machine
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• New exact algorithms for one-machine earliness-tardiness scheduling
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a batching machine
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Scheduling with agreeable release times and due dates on a batch processing machine
• Scheduling with batching: A review
• Scheduling. Theory, algorithms, and systems
• Single-machine scheduling with early and tardy completion costs
• Solving single batch-processing machine problems using an iterated heuristic
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

Cited in

(8)

• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• 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
• Single-machine batch scheduling with job processing time compatibility
• Arc-flow approach for single batch-processing machine scheduling
• Single machine batch just-in-time scheduling problems with common batch size and common due date of jobs
• Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
• Batch processing machine scheduling problems using a self-adaptive approach based on dynamic programming
• Batch sizing and just-in-time scheduling with common due date

This page was built for publication: Just-in-time single-batch-processing machine scheduling

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