scispace - formally typeset
Search or ask a question
Topic

Job shop

About: Job shop is a research topic. Over the lifetime, 3953 publications have been published within this topic receiving 99356 citations. The topic is also known as: Job shop.


Papers
More filters
Journal ArticleDOI
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.

2,173 citations

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.

1,264 citations

Journal ArticleDOI
TL;DR: In this article, an approximation algorithm for the problem of finding the minimum makespan in a job shop is presented, which is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
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.

1,107 citations

Book
24 Mar 1982
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.
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.

1,017 citations

Journal ArticleDOI
TL;DR: A review of the state of the art in the study of dispatching rules can be found in this paper, where a dispatching rule is used to select the next job to be processed from a set of jobs awaiting service.
Abstract: This paper reviews recent studies of dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. The paper has two objectives. The first is to discuss the state of the art in the study of dispatching rules. The discussion includes analytical approaches, simulation techniques and evaluation criteria. The second objective of the paper is to compare several of the dispatching rules listed in the Appendix using the results of recently published studies. It is impossible to identify any single rule as the best in all circumstances. However, several rules have been identified as exhibiting good performance in general.

967 citations


Network Information
Related Topics (5)
Supply chain management
39K papers, 1M citations
86% related
Supply chain
84.1K papers, 1.7M citations
85% related
Heuristics
32.1K papers, 956.5K citations
83% related
Scheduling (computing)
78.6K papers, 1.3M citations
83% related
New product development
41.5K papers, 1M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202343
2022128
2021115
2020124
2019132
2018134