scispace - formally typeset
Topic

Job shop

About: Job shop is a(n) research topic. Over the lifetime, 3953 publication(s) have been published within this topic receiving 99356 citation(s). The topic is also known as: Job shop.

...read more

Papers
More filters

Journal ArticleDOI
Éric D. Taillard1Institutions (1)
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.

...read more

Abstract: In this paper, we propose 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are: the permutation flow shop, the job shop and the open shop scheduling problems. We restrict ourselves to basic problems: the processing times are fixed, there are neither set-up times nor due dates nor release dates, etc. Then, the objective is the minimization of the makespan.

...read more

1,945 citations


8


Journal ArticleDOI
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.

...read more

Abstract: The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219–239], who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times. It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others.

...read more

1,195 citations


11


Journal ArticleDOI
Abstract: We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems. The generalization involves the acceptance of cost-increasing transitions with a nonzero probability to avoid getting stuck in local minima. We prove that our algorithm asymptotically converges in probability to a globally minimal solution, despite the fact that the Markov chains generated by the algorithm are generally not irreducible. Computational experiments show that our algorithm can find shorter makespans than two recent approximation approaches that are more tailored to the job shop scheduling problem. This is, however, at the cost of large running times.

...read more

1,071 citations


Book
24 Mar 1982-
Abstract: (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Journal of the Operational Research Society: Vol. 33, No. 9, pp. 862-862.

...read more

1,012 citations


Journal ArticleDOI
01 Jun 1996-Management Science
TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented, based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions.

...read more

Abstract: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions. Computational experiments up to 2,000 operations show that the algorithm not only finds shorter makespans than the best approximation approaches but also runs in shorter time. It solves the well-known 10 × 10 hard benchmark problem within 30 seconds on a personal computer.

...read more

926 citations


Network Information
Related Topics (5)
Flow shop scheduling

14.3K papers, 333.3K citations

91% related
Production planning

10K papers, 162.8K citations

91% related
Job shop scheduling

35.2K papers, 658.3K citations

90% related
Flexible manufacturing system

3.4K papers, 63.6K citations

89% related
Kanban

1.1K papers, 20K citations

88% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20225
2021114
2020124
2019132
2018134
2017149

Top Attributes

Show by:

Topic's top 5 most impactful authors

Nikolay Tchernev

19 papers, 336 citations

Camino R. Vela

19 papers, 246 citations

Mark Stevenson

18 papers, 746 citations

Martin Land

16 papers, 747 citations

Jorge Puente

14 papers, 196 citations