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
An artificial neural network based heuristic for flow shop scheduling problems
TL;DR: The objective of this paper is to find a sequence of jobs in the flow shop to minimize makespan and it is found that the ANN-GA and ANN-Suliman heuristic approaches perform better than NEH and CDS-SULiman heuristics for the problems considered.
Journal ArticleDOI
Metrics for evaluating distributed manufacturing control systems
TL;DR: It is suggested that it is worthwhile to use both manufacturing and control system performance measure to evaluate alternative control architectures, especially when considering dynamic architectures such as a Holonic Manufacturing System (HMS).
Journal ArticleDOI
Two-machine flowshop scheduling with bicriteria problem
Fuh-Der Chou,Ching-En Lee +1 more
TL;DR: In this paper, a two-machine flow shop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighted sum of total flow time and makespan, is formulated.
Journal ArticleDOI
Decision Support System for Scheduling Steel Fabrication Projects
G. Karumanasseri,Simaan AbouRizk +1 more
TL;DR: In this paper, a decision support system for planning and scheduling of steel fabrication projects is presented, which can be applied to any construction job shop scheduling exercise, and its main advantage over techniques such as CPM is that it is resource driven; its advantages over simulation techniques are its simplicity and overall schedule development time.
Journal ArticleDOI
Nondominated Schedules for a Job-Shop with Two Competing Users
TL;DR: The set of nondominated schedules over which the users may negotiate and develop a polynomial algorithm to find this nondominated set is characterized.