Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints
DOI10.3934/jimo.2021190OpenAlexW3212584764MaRDI QIDQ2083384
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
Mixed integer programming (90C11) Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Optimization by Simulated Annealing
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
- Future paths for integer programming and links to artificial intelligence
- Machine scheduling with soft precedence constraints
- Applying multiple objective tabu search to continuous optimization problems with a simple neighbourhood strategy
- Handbook of metaheuristics
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