Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study

DOI10.1016/j.cor.2017.06.019zbMath1391.90315OpenAlexW2726738415MaRDI QIDQ1651526

B. Shahidi-Zadeh, A. Taheri-Moghadam, I. Rastgar, Reza Tavakkoli-Moghaddam

Publication date: 12 July 2018

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

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

zbMATH Keywords

production schedulingsensitivity analysis\(\varepsilon\)-constraint methodmulti-objective harmony searchunrelated parallel batch processors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (6)

Closed loop supply chain network design under uncertain price-sensitive demand and return ⋮ Scheduling unrelated additive manufacturing machines with practical constraints ⋮ Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility ⋮ Parallel batching with multi-size jobs and incompatible job families ⋮ MILP models to minimise makespan in additive manufacturing machine scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Scheduling unrelated parallel machines with sequence-dependent setups
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Robust design for unconstrained optimization problems using the Taguchi method
• Scheduling

This page was built for publication: Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study