Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints

DOI10.3934/JIMO.2021190MaRDI QIDQ2083384zbMATH OpenOpenAlexFDO

Authors Reza Alizadeh Foroutan, Javad Rezaeian, Milad Shafipour

Publication date 10 October 2022

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2021190

zbMATH Keywords

just-in-timemachine eligibilityparallel machines schedulingprecedence constraintsworker allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
• A scheduling problem with unrelated parallel machines and sequence dependent setups
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem
• A hybrid multi-objective teaching-learning-based optimization algorithm for unrelated parallel machine scheduling problem

Cites work

• Applying multiple objective tabu search to continuous optimization problems with a simple neighbourhood strategy
• Future paths for integer programming and links to artificial intelligence
• Handbook of metaheuristics
• Machine scheduling with soft precedence constraints
• Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
• Optimization by simulated annealing

Cited in

(12)

• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
• Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem
• A performance comparison and evaluation of metaheuristics for a batch scheduling problem in a multi-hybrid cell manufacturing system with skilled workforce assignment
• Bi-objective parallel machine scheduling with additional resources during setups
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• A hybrid multi-objective teaching-learning-based optimization algorithm for unrelated parallel machine scheduling problem
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
• Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints
• Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions
• The fourth comprehensive review of scheduling problems with setup times
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

This page was built for publication: Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints

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