Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
From MaRDI portal
\(\varepsilon\)-constraint methodmulti-objective harmony searchproduction schedulingsensitivity analysisunrelated parallel batch processors
Numerical mathematical programming methods (65K05) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
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
- 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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 5241907 (Why is no real title available?)
- 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)- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Scheduling unrelated additive manufacturing machines with practical constraints
- 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
- Multi-objective scheduling for multi-product batch process with no-wait constraint
- Closed loop supply chain network design under uncertain price-sensitive demand and return
- 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
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
- Unbounded parallel-batch scheduling to minimize the total weighted tardy span
- Towards sustainable scheduling of unrelated parallel batch processors: a multiobjective approach with triple bottom line, classical and data-driven robust optimization
- A new bi-objective simultaneous model for timetabling and scheduling public bus transportation
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)
