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
Modelling collaborative planning and scheduling scenarios that include human and computer decision activities
TL;DR: In this paper, the authors place collaborative planning and scheduling within a systems-thinking context and show that human experts at the task control level are fundamental controllers of operations and coordinators of activities.
Journal ArticleDOI
Job-shop development model: a case study
C.A. Leonhard,J.S. Davis +1 more
TL;DR: A model based on dividing activities into jobs that accounts for divided time and more accurately categorizes rework costs is evaluated, which lets organizations represent software development in more detail than they can with many existing models.
Dissertation
Contribution à l'étude de la performance et de la robustesse des ordonnancements conjoints Production/Maintenance - Cas du Flowshop.
TL;DR: In this article, the authors propose an adaptive heuristique for l'ordonnancement conjoint production/maintenance in an atelier de type flow shop de permutation.
Journal Article
Performance Analysis of Flowshop Scheduling Using Genetic Algorithm Enhanced with Simulation
TL;DR: New hybrid genetic algorithm is developed using C-programming language for four different methods to solve flow shop scheduling problems using Genetic Algorithms to obtain good solutions may be close to optimum sequence with minimum cycle time or make span time for a flow shop problem.
Journal ArticleDOI
Single-machine scheduling to minimize earliness and number of tardy jobs
T.C.E. Cheng,H. G. Kahlbacher +1 more
TL;DR: In this paper, the problem of assigning a common due-date to a set of simultaneously available jobs and sequencing them on a single machine is considered, and an efficient algorithm of O(n log n) time complexity is presented and an illustrative example is provided.