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

DOI10.1016/J.COR.2017.06.019MaRDI QIDQ1651526zbMATH OpenOpenAlexFDO

Authors B. Shahidi-Zadeh, A. Taheri-Moghadam, I. Rastgar, R. 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

sensitivity analysisproduction scheduling\(\varepsilon\)-constraint methodmulti-objective harmony searchunrelated parallel batch processors

Mathematics Subject Classification ID

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

Recommendations

• A hybrid multi-objective teaching-learning-based optimization algorithm for unrelated parallel machine scheduling problem
• Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
• A multi-objective optimization model and its algorithm for hybrid parallel machine scheduling 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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 5241907 (Why is no real title available?)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• 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
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• 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 jobs with release dates on parallel batch processing machines to minimize the makespan
• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Scheduling unrelated parallel machines with sequence-dependent setups
• Scheduling. Theory, algorithms, and systems.

Cited in

(14)

• MILP models to minimise makespan in additive manufacturing machine scheduling problems
• Closed loop supply chain network design under uncertain price-sensitive demand and return
• Towards sustainable scheduling of unrelated parallel batch processors: a multiobjective approach with triple bottom line, classical and data-driven robust optimization
• Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
• A new bi-objective simultaneous model for timetabling and scheduling public bus transportation
• Parallel batching with multi-size jobs and incompatible job families
• Scheduling unrelated additive manufacturing machines with practical constraints
• Multi-objective scheduling for multi-product batch process with no-wait constraint
• Unbounded parallel-batch scheduling to minimize the total weighted tardy span
• A hybrid multi-objective teaching-learning-based optimization algorithm for unrelated parallel machine scheduling problem
• Multi-objective optimization and multi-attribute decision making for a novel batch scheduling problem based on mould capabilities
• Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
• Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint

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

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