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

DOI10.1016/j.cor.2020.105194OpenAlexW3117547854MaRDI QIDQ2027084

Feng Wu, Zhen Yang, Hong Bin Zhang

Publication date: 21 May 2021

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

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

zbMATH Keywords

schedulinghybrid approachjust-in-timebatch processingnon-identical due dates

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
• An improved earliness--tardiness timing algorithm
• Flowshop scheduling problem with a batching machine and task compatibilities
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• Bi-objective scheduling on a restricted batching machine
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Earliness and tardiness scheduling problems on a batch processor
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
• Solving single batch-processing machine problems using an iterated heuristic
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling a batch processing machine with non-identical job sizes
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Scheduling
• Adapting self-adaptive parameters in evolutionary algorithms
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: 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