Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints

DOI10.1155/2018/6024631zbMath1427.90160OpenAlexW2793037814WikidataQ130186469 ScholiaQ130186469MaRDI QIDQ1721157

Bailin Wang, Hai-Feng Wang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/6024631

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping ⋮ Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints

Cites Work

• A survey on offline scheduling with rejection
• Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
• List scheduling in a parallel machine environment with precedence constraints and setup times
• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
• Parallel machine scheduling with machine availability and eligibility constraints
• Flowshop-scheduling problems with makespan criterion: a review
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints