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 heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
TL;DR: The proposed heuristic algorithm as well as the existing heuristic are evaluated in a large number of randomly generated large-sized flowshop problems and the effectiveness of these heuristics with respect to the objective of minimizing total machine idletime is investigated.
Journal ArticleDOI
Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times
TL;DR: An extensive performance analysis has shown that the proposed heuristics are computationally faster and more effective in yielding solutions of better quality than the benchmark procedures.
Journal ArticleDOI
Real-time scheduling of an automated manufacturing center *
TL;DR: Investigation of the dynamic scheduling of an automated manufacturing workcenter at which jobs are processed in batches, and there is a constant changeover time between batches of different part types results inistics of the optimal solutions to the mean flow time and mean tardiness problems are developed.
Journal ArticleDOI
Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
John L. Hunsucker,J.R. Shah +1 more
TL;DR: A dynamic simulation model of the constrained flow shop with multiple processors environment was developed in which the queuing priorities at each machine stage were established dynamically, and the results indicated that the shortest processing time first dispatching procedure (SPT) yielded superior performance for the makespan and mean flow time criteria.
Proceedings Article
Randomized large neighborhood search for cumulative scheduling
TL;DR: The described approach obtains the best known performance reported to date on the CJSSP, and not only finds better solutions than ever reported before for 33 out of 36 open instances, it also proves to be very robust on the complete set of test instances.