Auction-based approach for a flexible job-shop scheduling problem with multiple process plans

DOI10.1080/0305215X.2018.1561884OpenAlexW2910040115WikidataQ128535286 ScholiaQ128535286MaRDI QIDQ5059253

Zhi-Ping Fan, Chengkuan Zeng, Chongjun Yan, Jiafu Tang

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

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

zbMATH Keywords

flexible job-shop scheduling problemmultiple process plansauction-based approach

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Scheduling of a job-shop problem with limited output buffers ⋮ Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint

Uses Software

• SPSS
• JOBSHOP

Cites Work

• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
• A research survey: review of flexible job shop scheduling techniques
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Solving chiller loading optimization problems using an improved teaching‐learning‐based optimization algorithm
• Auction-based distributed scheduling and control scheme for flexible manufacturing systems
• Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem

This page was built for publication: Auction-based approach for a flexible job-shop scheduling problem with multiple process plans