Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint
DOI10.1080/0305215x.2021.1983558zbMath1523.90217OpenAlexW4200066386MaRDI QIDQ6094840
Zixuan Liu, Chengkuan Zeng, Jiafu Tang, Chongjun Yan, Zhi-Ping Fan
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
local searchjob-shop schedulingmachine availability constraintparallel batch processingauction-based approach
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (1)
Cites Work
- Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- A GRASP algorithm for flexible job-shop scheduling with maintenance constraints
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Auction-based distributed scheduling and control scheme for flexible manufacturing systems
- Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities
- Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
- Scheduling of a job-shop problem with limited output buffers
- Integrated scheduling on parallel batch processing machines with non-identical capacities
This page was built for publication: Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint
