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
A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
TL;DR: The algorithm is a hybrid of a greedy approach, followed by a simulated annealing search of the V-shaped sequence solution space, which gives better solutions than the heuristics previously presented in the literature.
Local Search and Backtracking vs Non-Systematic Backtracking
TL;DR: This paper addresses the following question: what is the essential difference between stochastic local search (LS) and systematic backtracking (BT) that gives LS superior sealability?
Journal ArticleDOI
Single machine scheduling with symmetric earliness and tardiness penalties
TL;DR: This research focuses on scheduling jobs with varying processing times and distinct due dates on a single machine subject to earliness and tardiness penalties, and finds application in a just-in-time (JIT) production environment.
Journal ArticleDOI
Scheduling with Sequencing Flexibility
TL;DR: The findings show that taking advantage of even low levels of sequencing flexibility in the set of operations required to do a job results in substantial improvement in the performance of scheduling rules with respect to mean flowtime.
Journal ArticleDOI
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
TL;DR: It is proved that even when the machine works at a variable rate, the pair-wise interchange of jobs minimizes the maximum tardiness and a simple modification to the well-known Moore-Hodgson's algorithm yields the minimum number of tardy jobs.