Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

DOI10.1016/J.COR.2010.04.009MaRDI QIDQ709121zbMATH OpenOpenAlexFDO

Authors Xiangyong Li, M. Fazle Baki, Y. P. Aneja

Publication date 15 October 2010

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

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

zbMATH Keywords

ant colony optimizationinteger programmingschedulingmetaheuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• Solving the continuous flow-shop scheduling problem by metaheuristics.
• An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• scientific article; zbMATH DE number 2079888
• An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal

Cites work

• scientific article; zbMATH DE number 4149877 (Why is no real title available?)
• scientific article; zbMATH DE number 2222042 (Why is no real title available?)
• A note on scheduling alternative operations in two-machine flowshops
• A survey of scheduling problems with setup times or costs
• Ant colony optimization.
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
• Complexity results for flow-shop problems with a single server
• Complexity results for parallel machine problems with a single server
• One-Operator, Two-Machine Open Shop And Flow Shop Scheduling With Setup Times For Machines And Maximum Lateness Objective
• One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
• One-operator-two-machine flowshop scheduling with setup and dismounting times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with a common server
• Scheduling a single server in a two-machine flow shop
• Scheduling for parallel dedicated machines with a single server
• Scheduling the production of two-component jobs on a single machine
• Scheduling with batching: A review

Cited in

(1)

• Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan

This page was built for publication: Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

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