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 survey of single machine scheduling to minimize weighted number of tardy jobs
TL;DR: This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used.
Journal ArticleDOI
Openshops with jobs overlap
TL;DR: In this article, the complexity status of scheduling n jobs in an open-hop with m machines, when overlapping of jobs is permitted, for some classical objective functions was investigated. And it was shown that the maximum completion time and maximum tardiness are polynomial, and that the number of late jobs problem is binary NP-hard in the two-machine case.
Journal ArticleDOI
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization
Yi Zhang,Xiaoping Li +1 more
TL;DR: Experimental results show that the inheritance of good ''genes'' obtained by LCS can improve the performance of the proposed EDA, and the proposed hybrid EDA outperforms other existing algorithms for the considered problem in the literature.
Journal ArticleDOI
A generic library of problem solving methods for scheduling applications
TL;DR: The generic nature of this library is demonstrated by constructing seven methods for scheduling as an alternative specialization of the model, and it is validated on a number of applications to demonstrate its generic nature and effective support for developing scheduling applications.
Journal ArticleDOI
Two-agent single-machine scheduling with release times and deadlines
TL;DR: Inspired by the importance of ready times, the single-machine two-agent scheduling problem with releases times and deadlines is studied to minimise the number of tardy jobs of one agent under the restriction that the maximum lateness of the jobs of the other agent cannot exceed a given value Q.