A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

Tan, Yi; Mönch, Lars; Fowler, John W.

doi:10.1007/s10951-017-0530-4

Cited by 43 publications

(26 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To minimize total tardiness, they employ a bottleneck-focused technique, which first constructs a schedule on the bottleneck workstation and subsequently considers the other stages. Similar strategies can be found in Shahvari and Logendran (2018) and Tan et al (2018).…”

Section: Literature Reviewmentioning

confidence: 65%

“…Hybrid flow shops occur widely in current-day manufacturing, and are often enriched with complex and practical constraints such as limited buffers (Baumann and Trautmann, 2013;Liu et al, 2017), no buffers (Grabowski and Pempera, 2000;Gicquel et al, 2012), limited-waiting restrictions (Gicquel et al, 2012), no-wait constraints (Grabowski and Pempera, 2000;Berghman et al, 2014;Berghman and Leus, 2015), machine eligibility constraints (Liu et al, 2017;Shahvari and Logendran, 2018), re-entrant flows (Chamnanlor et al, 2014;Schulze et al, 2016), batch processing (Liu et al, 2017;Tan et al, 2018), release dates (Shahvari and Logendran, 2018), sequence-dependent setup times (Bang and Kim, 2011), dedicated machines (Hadda et al, 2014), and so on. These technical constraints often arise with multiple stages (Almada-Lobo et al, 2008;Gicquel et al, 2012;Baumann and Trautmann, 2013;Chamnanlor et al, 2014) and large-scale instances (Almada-Lobo et al, 2008;Baumann and Trautmann, 2013;Schulze et al, 2016;Liu et al, 2017), resulting in a complicated and difficult problem.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling hybrid flow shops with time windows

Yang

Leus

2019

J Heuristics

View full text Add to dashboard Cite

Hybrid flow shops can be encountered in various industrial settings. In this paper we develop methods for scheduling hybrid flow shops with hard time windows. Specifically, we study a two-stage hybrid flow shop scheduling problem with time windows to minimize the total weighted completion times. Each stage consists of one or more identical parallel machines, and each job visits two processing stages in series. Finding a feasible schedule with hard time windows is a challenging task in this setting, because it is NP-complete in the strong sense even for a single machine in a single stage. We propose two matheuristics to find an initial feasible solution by local branching. We also develop two schedule improvement procedures, one based on stage-by-stage decomposition, and one using adapted local branching. The performance of our methods is validated via extensive computational experiments.

show abstract

Section: Literature Reviewmentioning

confidence: 65%

Section: Literature Reviewmentioning

confidence: 99%

Scheduling hybrid flow shops with time windows

Yang

Leus

2019

J Heuristics

View full text Add to dashboard Cite

show abstract

“…The processing time in this machine is the amount of processing time of every job in the batch. Second, BPM is understood as a machine processing a number of jobs in a batch at the same time whose time processing is not changing and influenced by the number of jobs in the batch [13], [14], [15], [16], [17], [18], [19], [20], [21], [22].…”

Section: Introductionmentioning

confidence: 99%

Three-stage flow-shop scheduling model with batch processing machine and discrete processing machine

Mauluddin¹

2018

MATEC Web Conf.

View full text Add to dashboard Cite

This study discusses the model development of three-stage flow-shop scheduling involving Batch Processing Machine (BPM) and Discrete Processing Machine (DPM). Each job passes several stages of the production process from the first stage in DPM-a, the second stage in BPM, to the third stage in DPM-b. Each job is sequentially processed in DPM-a and DPM-b. in BPM; every job is handled simultaneously at the same time. The maximum weight determines the capacity of BPM. This study uses mathematic modeling approach. The result model produced in this study is Mixed Integer Linear Programming (MILP) Model. Purpose function model is minimizing total completion time. Model testing is done by using numerical examples with several data scenarios. The results showed that the model produced was the optimum model and provided a unique schedule pattern. In the future research can be formulated the heuristic model.

show abstract

mentioning

confidence: 99%

“…Four mixed integer programming (MIP) formulations are developed, followed by a computational study. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines" (Tan et al 2017) considers problems of the type which might, for example, be found in semiconductor wafer fabrication facilities. Similar to the previous paper, a MIP formulation is presented which is addressed using an iterative stage-based decomposition approach, hybridised with a local search.…”

mentioning

confidence: 99%

Preface

Hanzálek

Kendall

McCollum

et al. 2018

J Sched

View full text Add to dashboard Cite

the conference website (http://www.schedulingconference. org/proceedings/).Following the conference, authors were invited to submit revised versions of their papers to a special issue of the Journal of Scheduling. The 8 accepted papers are those that received supportive reviews after undergoing a review process in keeping with the expectations of an internationally recognised journal.Three of the papers in this special issue consider staff scheduling problems. In "A list-scheduling heuristic for the short-term planning of assessment centers" (Zimmermann and Trautmann 2017), the authors investigate a novel planning problem that utilises a multi-pass list-scheduling heuristic for scheduling candidates to undertake a set of tasks so that they can be evaluated. The paper "The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster" (Ingels and Maenhout 2017) investigates the trade-off between a hiring budget and an overtime budget and the way overtime should be allocated in the personnel management process. The authors apply a three-step methodology, resulting in the formulation of managerial guidelines for hiring and overtime policy. "Staff assignment with lexicographically ordered acceptance levels" (Rihm and Baumann 2017) introduces a real-world staff assignment problem, where current approaches from the scientific literature are not suitable. The matheuristic that is utilised scales well and outperforms commercial employee scheduling software.The next four papers focus on different aspects of shop scheduling problems. In "Approaches to modeling train scheduling problems as job-shop problems with blocking constraints" (Lange and Werner 2017), the focus is on train scheduling, specifically trains travelling through railway networks comprising single tracks, sidings and stations. The problem is modelled as a job-shop problem, with blocking constraints. Four mixed integer programming (MIP) formulations are developed, followed by a computational study. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines" (Tan et al. 2017) considers problems of the type which might, for example, be 123

show abstract

A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

Cited by 43 publications

References 39 publications

Scheduling hybrid flow shops with time windows

Scheduling hybrid flow shops with time windows

Three-stage flow-shop scheduling model with batch processing machine and discrete processing machine

Preface

Contact Info

Product

Resources

About