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
Use of variable range in solving multiple criteria scheduling problems
TL;DR: In this paper, a variable range technique is proposed to find the efficient schedules in a multiple criteria scheduling problem, which can be incorporated into many existing algorithms for finding efficient schedules, and three such incorporations are studied.
Journal ArticleDOI
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
TL;DR: In this paper, the authors characterize the search landscape of random instances of the job shop scheduling problem (JSP) and investigate how the expected values of backbone size, distance between near-optimal schedules, and makespan of random schedules vary as a function of job to machine ratio.
Journal ArticleDOI
Network planning for scheduling operations in air cargo handling: a tool in medium term goodsflow control
TL;DR: Standard software for network planning is successfully applied to scheduling transshipment operations of loading units in the hub of a hub-and-spokes network for airfreight transportation.
Journal ArticleDOI
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Mohamed Ali Rakrouki,Mohamed Ali Rakrouki,Anis Kooli,Sabrine Chalghoumi,Talel Ladhari,Talel Ladhari +5 more
TL;DR: This work derives several lower bounds as well as a branch-and-bound algorithm for the problem under consideration of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates.
Journal ArticleDOI
The machine duplication problem in a job shop with two jobs
TL;DR: The problem is proved to be in general NP-hard in the strong sense, but in a class of special cases, relevant from the applications viewpoint, it can be solved in polynomial time by a dynamic programming algorithm.