Open AccessBook
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
Reads0
Chats0
TLDR
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.read more
Citations
More filters
Journal ArticleDOI
Parallel Simulated Annealing Algorithms
TL;DR: This paper presents two general algorithms for simulated annealing that have been applied to job shop scheduling problem and the traveling salesman problem and it is observed that it is possible to achieve superlinear speedups using the algorithm.
Journal ArticleDOI
A new heuristic for the n-job, M-machine flow-shop problem
Johnny C. Ho,Yih-Long Chang +1 more
TL;DR: This new method minimizes gaps between successive operations in solutions generated by other heuristics to solve the flow-shop scheduling problem by using makespan, mean flow time and mean utilization as the performance measures.
Book ChapterDOI
A Grasp for Job Shop Scheduling
TL;DR: A greedy randomized adaptive search procedure (GRASP) for the job shop scheduling problem (JSP) is described and two new concepts are incorporated: an intensification strategy and POP in the construction phase.
Journal ArticleDOI
Heuristic algorithm for scheduling in a flowshop to minimize total flowtime
TL;DR: In this paper, a heuristic algorithm is presented for scheduling in a flow shop to minimize the total flowtime of jobs, where a preference relation is developed and used as the basis for job insertion to build up the complete schedule.
Journal ArticleDOI
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
TL;DR: In this article, a heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling problem under study.