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
Minimizing the weighted number of tardy jobs on multiple machines: A review
TL;DR: An overview of the history, the methods and the people who researched on minimizing the (weighted) number of tardy jobs as a performance measure is provided in this article, where cases on multiple machines: parallel machines (including the identical, uniform and unrelated machines, flow shop, job shop and the open shop).
Book ChapterDOI
Operational Research Approaches to Artificial Intelligence in Production Planning and Scheduling
Ray J. Paul,Georgios I. Doukidis +1 more
TL;DR: Artificial Intelligence is taking an enthusiastic interest in production planning problems, devising many theoretical structures for classes of hypothetical problems as discussed by the authors, and operational research approaches to incorporate the benefits of artificial intelligence research in Production Planning and Scheduling.
Journal ArticleDOI
Efficient elicitation of software configurations using crowd preferences and domain knowledge
TL;DR: This work introduces a technique for designing optimal interactive configuration elicitation dialogs, aimed at utilizing crowd and expert information to reduce the amount of manual configuration effort.
Book ChapterDOI
The Operation of Manufacturing Systems
TL;DR: The operation of a manufacturing system is the complex task of planning the material and information flows in the system, which is a direct consequence of the system’s information flows.
Journal ArticleDOI
A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates
TL;DR: A new population heuristic based on the particle swarm optimization (PSO) technique is presented to solve the single machine early/tardy scheduling problem against a restrictive common due date to minimize a summation of earliness and tardiness penalty costs.