Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint

DOI10.1080/0305215X.2021.1983558MaRDI QIDQ6094840zbMATH OpenOpenAlexFDO

Authors Chengkuan Zeng, Zixuan Liu, Jiafu Tang, Zhiping Fan, Chongjun Yan

Publication date 10 October 2023

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2021.1983558

zbMATH Keywords

local searchjob-shop schedulingmachine availability constraintparallel batch processingauction-based approach

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Mixed integer programming (90C11)

Recommendations

• Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
• MIP formulations and heuristics for solving parallel batching problems
• Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing

Cites work

• A GRASP algorithm for flexible job-shop scheduling with maintenance constraints
• Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
• Auction-based distributed scheduling and control scheme for flexible manufacturing systems
• Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
• Integrated scheduling on parallel batch processing machines with non-identical capacities
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Scheduling of a job-shop problem with limited output buffers
• Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

Cited in

(3)

• Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
• Novel model and solution method for flexible job shop scheduling problem with batch processing machines
• Approximations and auctions for scheduling batches on related machines

This page was built for publication: Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint

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