Two models for a family of flowshop sequencing problems

Stafford, Edward F.; Tseng, Fan T.

doi:10.1016/s0377-2217(01)00320-4

Cited by 57 publications

(23 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Branch and bound based approaches presented in [6], [7] find optimal schedules for the flowshop scheduling problem. Similarly mixed integer programs are used by [8], [9] to solve different variants of flowshop scheduling problem to optimality but are not suitable for online scheduling.…”

Section: Resultsmentioning

confidence: 99%

A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer

Waqas¹,

Geilen²,

Kandelaars³

et al. 2015

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2015

View full text Add to dashboard Cite

Abstract-A Large Scale Printer (LSP) is a CyberPhysical System (CPS) printing thousands of sheets per day with high quality. The print requests arrive at run-time requiring online scheduling. We capture the LSP scheduling problem as online scheduling of reentrant flowshops with sequence dependent setup times and relative due dates with makespan minimization as the scheduling criterion. Exhaustive approaches like Mixed Integer Programming can be used, but they are compute intensive and not suited for online use. We present a novel heuristic for scheduling of LSPs that on average requires 0.3 seconds per sheet to find schedules for industrial test cases. We compare the schedules to lower bounds, to schedules generated by the current scheduler and schedules generated by a modified version of the classical NEH (MNEH) heuristic [1], [2]. On average, the proposed heuristic generates schedules that are 40% shorter than the current scheduler, have an average difference of 25% compared to the estimated lower bounds and generates schedules with less than 67% of the makespan of schedules generated by the MNEH heuristic.

show abstract

Section: Resultsmentioning

confidence: 99%

A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer

Waqas¹,

Geilen²,

Kandelaars³

et al. 2015

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2015

View full text Add to dashboard Cite

show abstract

“…Constraint set (13) specifies that job j is assigned to exactly one machine of one factory. Constraint set (14) calculates the completion time of each job. Constraint sets (15) and (16) define the decision variables.…”

Section: ‫ܥ‬mentioning

confidence: 99%

“…The MILP models are evaluated using two frequently used performance measures of size and computational complexities [14]. The size complexity is the numbers of binary variables (BV), the number of continuous variables (CV) and the number of constraints required by a model.…”

Section: Models' Evaluationmentioning

confidence: 99%

Multi-factory parallel machine problems: Improved mathematical models and artificial bee colony algorithm

Yazdani

Gohari

Naderi

2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…The first set is for the experiment with small shops (Taillard, 1993) (Pan, 1997;Stafford & Tseng, 2002). The size com-579 plexity is the numbers of binary variables (BV), the number of con-580 tinuous variables (CV) and the number of constraints required by a 581 model (Pan, 1997).…”

Section: Jobmentioning

confidence: 99%