Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

González, Pérez

doi:10.1016/j.cor.2008.12.018

Cited by 22 publications

(18 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is not only motivated by breakdowns or planned maintenance, but also because machines are busy processing already scheduled jobs. However, existing research on this topic is almost inexistent (see Besbes et al, 2010 or Perez-Gonzalez andFraminan, 2009 for initial works on the topic).…”

Section: "New" Types Of Constraintsmentioning

confidence: 99%

Guidelines for the deployment and implementation of manufacturing scheduling systems

Framiñán

Ruíz

2012

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

It has been frequently stated that there exists a gap between production scheduling theory and practice. In order to put the theoretical findings into practice, the advances in scheduling models and solution procedures should be embedded into a piece of software -a scheduling system-at work in the companies. This results in a process which entails 1) determining its functional features, and 2) adopting a successful strategy for its development and deployment. In this paper we address the latter question and review the related literature in order to identify descriptions and recommendations of the main aspects to be taken into account when developing such system. These issues are then discussed and classified, resulting in a set of guidelines that can help practitioners during the process of developing and deploying a scheduling system. In addition, the identification of these issues can provide some insights to drive the theoretical scheduling research towards those topics more demanded by practitioners, thus helping in closing the aforementioned gap.

show abstract

Section: "New" Types Of Constraintsmentioning

confidence: 99%

Guidelines for the deployment and implementation of manufacturing scheduling systems

Framiñán

Ruíz

2012

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…RS and RT are two strategies which attach new orders to the end of the existing schedule. It has been confirmed that rescheduling the remaining jobs of the old order can provide a higher quality schedule [13,16,24]. However, no reactive methods can provide high-quality solutions with order mixing, therefore missing the opportunity of optimized schedule [25].…”

Section: Related Workmentioning

confidence: 96%

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

Liu

Jin

Price

2018

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Permutation flowshop scheduling problem (PFSP) has attracted lots of attention from both academia and industry as it finds many applications especially for today's mass customization. The PFSP is proved NP-hard, and the dynamic uncertainties such as stochastic new order arrivals significantly increase the problem complexity and difficulty. Many enterprises often struggle to make decisions on accepting new orders and setting due dates for them due to lack of effective scheduling methods. To fill in the knowledge gap, this paper is to propose a new meta-heuristic algorithm which is based on a new enhanced destruction and construction method and a novel repair method while adopting the architecture of the iterated greedy algorithm. Statistical tests were conducted and results show that the new algorithm outperforms existing ones. The maximum completion time of the new order

show abstract

“…However, this assumption can be only applied in real-world problems if it is the first time that jobs are to be scheduled in the shop, or a long period without processing jobs has occurred. Since these assumptions are not common in practice, [30] consider restrictions in the initial availability of the machines for the minimisation of the makespan. Results show how the initial availability assumption make the problem easier (again in the sense of increasing the probability of finding a 'good' solution), specially if structured processing times are considered.…”

Section: Introductionmentioning

confidence: 99%

Boundary lines between permutation flowshop problems and single machine problems

Fernández-Viagas

2015

2015 International Conference on Industrial Engineering and Systems Management (IESM)

Self Cite

View full text Add to dashboard Cite

The permutation flowshop scheduling and the single machine scheduling problems are two classical problems in the scheduling literature. Since the former is known to be NP-hard for more than two machines, hundreds of algorithms have been implemented in the last decades to solve it. Furthermore, several computational studies have found that the permutation flowshop to minimise makespan is easily solvable for structured (i.e. processing times are job-and/or machine-correlated) instances and when the initial availability of all machines for processing jobs cannot be assumed. Our working hypothesis to explain this behaviour is that, under certain conditions of machine availability or structured processing times, only one stage in the flowshop layout determines the optimal sequence, approximately transforming the flowshop scheduling problem into a single machine scheduling problem. Since the single machine scheduling problem with makespan objective is a trivial problem where all feasible sequences are optimal, such transformation may explain why it is so easy to find good solutions for such flowshop scheduling problems. Therefore, the goal of this paper is to study under which assumptions a permutation flowshop scheduling problem can be reduced to a single machine scheduling problem. More specifically, we focus onto the two most common objectives in the literature (i.e. makespan and total flowtime). Our work is a combination of theoretical and computational analysis, therefore several properties are derived, together with an extensive computational evaluation.

show abstract

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Cited by 22 publications

References 34 publications

Guidelines for the deployment and implementation of manufacturing scheduling systems

Guidelines for the deployment and implementation of manufacturing scheduling systems

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

Boundary lines between permutation flowshop problems and single machine problems

Contact Info

Product

Resources

About