1996
DOI: 10.1016/0377-2217(95)00362-2
|View full text |Cite
|
Sign up to set email alerts
|

The job shop scheduling problem: Conventional and new solution techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
188
0
11

Year Published

1998
1998
2016
2016

Publication Types

Select...
7
3

Relationship

1
9

Authors

Journals

citations
Cited by 447 publications
(199 citation statements)
references
References 128 publications
0
188
0
11
Order By: Relevance
“…This is a well-researched area for which many algorithms have been developed and reviews published (e.g. Blackstone et al, 1982;Błażewicz et al, 1996). In MTO companieswhich often operate as job shops with high routing variability -detailed scheduling can be complex as, for example, it can be difficult to predict the arrival times of jobs at particular machines.…”
Section: Mto Requirements and Erp Functionality At The Shop Floor Dismentioning
confidence: 99%
“…This is a well-researched area for which many algorithms have been developed and reviews published (e.g. Blackstone et al, 1982;Błażewicz et al, 1996). In MTO companieswhich often operate as job shops with high routing variability -detailed scheduling can be complex as, for example, it can be difficult to predict the arrival times of jobs at particular machines.…”
Section: Mto Requirements and Erp Functionality At The Shop Floor Dismentioning
confidence: 99%
“…• Assignment Problems - (Cattrysse and Van Wassenhove, 1992, Loiola et al, 2007, Pentico, 2007 • Bioinformatics - (B lazewicz et al, 2005(B lazewicz et al, , Lukasiak et al, 2010 • Forecasting - Fildes (1979Fildes ( , 1985, Fildes et al (2008), Ghobbar and Friend (2003), Trapero et al (2015) • Job Shop Scheduling - (B lazewicz et al, 1996, Brucker et al, 2007, Cheng et al, 1999a,b, Kiran and Smith, 1984 • Knapsack Problem - (Lin, 1998, Lust and Teghem, 2012, Pisinger, 2007, Salkin and Kluyver, 1975, Wilbaut et al, 2008 • Personnel Scheduling - (Ernst et al, 2004, Miller, 1976 • Sports Scheduling - (Kendall et al, 2010, Rasmussen andTrick, 2008) • Traveling Salesman Problem - (Bellmore and Nemhauser, 1968, Burkard et al, 1998, Cook, 2011, Lust and Teghem, 2010 • Vehicle Routing - (Archetti and Speranza, 2008, Braysy et al, 2004, Braysy and Gendreau, 2005a,b, Cordeau et al, 2002, Doerner and Schmid, 2010, Gendreau et al, 2008, Jaillet and Wagner, 2008, Laporte, 2009, Vidal et al, 2013 Of course, there are many other areas which also come under the optimization research radar. Indeed, it is difficult to think of a discipline/sector that either does not currently use optimization research, or could benefit from some form of optimization.…”
Section: Introductionmentioning
confidence: 99%
“…The problem has been known for years in the scheduling theory as a particularly hard combinatorial optimisation case. Although in the last three decades a lot of effort has been put into research in this area, good results have appeared quite recently, see state-of-the-art papers by Bl ażewicz, Domschke, and Pesch (1996), Vaessens, Aarts, and Lenstra (1996), and Jain and Meeran (1999), supplemented by a few recent studies (Jain, Rangaswamy, and Meeran, 2000;Pezella and Merelli, 2000;Nowicki and Smutnicki, 2001).…”
Section: Introductionmentioning
confidence: 99%