The non-permutation flow-shop scheduling problem: a literature review
Abstract The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …
Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in Industry 4.0-based manufacturing system
Industry 4.0 is widely accepted in manufacturing industry since it guides a novel and
promising production paradigm. A new characteristic in Industry 4.0-based manufacturing …
promising production paradigm. A new characteristic in Industry 4.0-based manufacturing …
A genetic algorithm for energy-efficiency in job-shop scheduling
Many real-world scheduling problems are solved to obtain optimal solutions in term of
processing time, cost, and quality as optimization objectives. Currently, energy-efficiency is …
processing time, cost, and quality as optimization objectives. Currently, energy-efficiency is …
An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan
Nowadays, distributed scheduling problem is a reality in many companies. Over the last
years, an increasingly attention has been given by distributed flow shop scheduling …
years, an increasingly attention has been given by distributed flow shop scheduling …
Maintenance costs and makespan minimization for assembly permutation flow shop scheduling by considering preventive and corrective maintenance
The joint optimization of production scheduling and maintenance planning has a significant
influence on production continuity and machine reliability. However, limited research …
influence on production continuity and machine reliability. However, limited research …
A proactive approach to solve integrated production scheduling and maintenance planning problem in flow shops
W Cui, Z Lu, C Li, X Han - Computers & Industrial Engineering, 2018 - Elsevier
This paper deals with the integration of production scheduling and maintenance planning in
order to optimize the bi-objective of quality robustness and solution robustness for flow …
order to optimize the bi-objective of quality robustness and solution robustness for flow …
Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm
Nowadays, distributed scheduling problem is a reality in many companies. Over the last
years, an increasingly attention has been given to the distributed flow shop scheduling …
years, an increasingly attention has been given to the distributed flow shop scheduling …
Joint scheduling of jobs and variable maintenance activities in the flowshop sequencing problems: review, classification and opportunities
A Sadiqi, I El Abbassi, A El Barkany… - International Journal of …, 2018 - Trans Tech Publ
Much of the scheduling theory assumes that machines are always available to process jobs
at any time during the scheduling horizon. However, machines may be unavailable for …
at any time during the scheduling horizon. However, machines may be unavailable for …
Multi-objective teaching-learning-based meta-heuristic algorithms to solve multi-skilled project scheduling problem
S Zabihi, MR Kahag, H Maghsoudlou… - Computers & Industrial …, 2019 - Elsevier
In this paper, a novel multi-objective multi-skilled resource-constrained project scheduling
problem based on learning effect is presented in which efficiency of the workforce is …
problem based on learning effect is presented in which efficiency of the workforce is …
Flow shop learning effect scheduling problem with release dates
In a real-world assembly environment, the components of a product arrive at a plant over
time. Works-in-process are assembled into end-products by following an identical …
time. Works-in-process are assembled into end-products by following an identical …