Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
DOI10.1007/S40305-017-0165-3zbMath1413.90092OpenAlexW2618817371MaRDI QIDQ1656191
Publication date: 10 August 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0165-3
multi-objective optimizationtransportationNSGA-IIdistributed schedulingpermutation flow-shop scheduling
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Cites Work
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms
- Some efficient heuristic methods for the flow shop sequencing problem
- The distributed permutation flowshop scheduling problem
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
- New results on the coordination of transportation and batching scheduling
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Optimal two- and three-stage production schedules with setup times included
- The Complexity of Flowshop and Jobshop Scheduling
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Machine scheduling with transportation considerations
This page was built for publication: Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
