A practical approach to scheduling a multistage, multiprocessor flow-shop problem

Yanney, Jon D.; Kuo, Way

doi:10.1080/00207548908942651

Cited by 9 publications

(4 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In both cases, scheduling systems based on dispatching rules were designed. A real rubber production problem was studied by [227]. Another real problem, this time based on textile manufacturing, was approached by [143] with several ad-hoc heuristics.…”

Section: Heuristicsmentioning

confidence: 99%

See 1 more Smart Citation

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

681

236

View full text Add to dashboard Cite

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution.The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

show abstract

Section: Heuristicsmentioning

confidence: 99%

“…[182] F H2, ((P M (k) ) 2 k=1 )||Cmax dispatching rules based heuristics [227] F H3, ((P 2 (1) , 1 (2) , R5 (3) ))|skip, revisit|Cmax dispatching rules 1990…”

Section: Research Opportunities and Conclusionmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

681

236

View full text Add to dashboard Cite

show abstract

“…The hybrid flow shop problem is also called a flexible flow shop (FFS) problem (Adler et al, 1993) or a multiprocessor flow shop problem (Yanney and Kuo 1989).…”

Section: Hybrid Flow Shopmentioning

confidence: 99%

Optimal resource allocation for hybrid flow shop in one-of-a-kind production

Luo

Xue

et al. 2010

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

In one-of-a-kind production (OKP) companies, the number of production resources in each work centre of a production line is flexible in shifts because the resource demands of customer orders are always different from shift to shift. In this paper an optimisation model is established to achieve an optimal resource allocation plan ensuring that all jobs are finished in a given time interval with a minimum number of resources and without any buffer overflow. A branch-and-bound algorithm is developed to solve the problem. Two theorems are proved and applied in the algorithm to improve its pruning efficiency. A real industrial application is implemented for Gienow Windows and Doors Ltd. based on this model and algorithm. Experimental results show that this method is effective.

show abstract

“…The authors are convinced that the technique for predicting set-up times presented in this paper, that they developed and successfully implemented, is completely new. It does not make sense to include an exhaustive list of literature surveyed, but the first and last references, alphabetically, are Ashford [1], and Worral [3]. The technique was developed as part of a computerised scheduling system developed for a cardboard box manufacturing company [2].…”

Section: Introductionmentioning

confidence: 99%

Predicting Sequence Dependent Set-Up Times for Multistation Machines (A Case Study)

Reinecke

Page

2012

The South African Journal of Industrial Engineering

View full text Add to dashboard Cite

The set-up time for jobs on some multi-station machines , such as manually configured colour printers, are sequence dependent. Many techniques exist for fmding a sequence in which to process the jobs to reduce total set-up time significantly. They all require an estimate ofthe set-up time for each job given the set-up of the previous job. In practice predicting set-up times for scheduling purposes may become prohibitively time consuming. In this article a practical technique is presented that estimates the set-up time for ajob on a multi-station machine, such as a manually configured printer. An application in a corrugated cardboard box factory, where the technique is in use as part of a computerised scheduling system, is discussed. OpsommingDie opsteltyd vir take op sommige veelstasie masjiene, soos handgekonfigureerde kleurdrukkers, is . volgorde afhanklik. Vele tegnieke bestaan om die volgorde te bepaal waarin take geprosesseer moet word om opsteltyd beduidend te verminder. Al die tegnieke vereis die opsteltyd van die volgende taak, gegewe die opsteltyd van die voorgaande taak. In die praktyk mag raming van opsteltye vir skeduleringsdoeleindes onhanteerbaar lank neem. In hierdie artikel word 'n praktiese tegniek beskryf wat die opsteltyd beraarn vir vir 'n taak op 'nveelstasie masjien, soos 'n handgekonfigureerde drukpers. 'n Toepassing in 'n riffelkartondoos fabriek , waar die tegniek toegepas word as deel van ' n gerekenariseerde skeduleringsisteem, word bespreek.

show abstract

A practical approach to scheduling a multistage, multiprocessor flow-shop problem

Cited by 9 publications

References 2 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Optimal resource allocation for hybrid flow shop in one-of-a-kind production

Predicting Sequence Dependent Set-Up Times for Multistation Machines (A Case Study)

Contact Info

Product

Resources

About