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 new AGV scheduling algorithm based on harmony search for material transfer in a real-world manufacturing system:
TL;DR: An improved harmony search algorithm is proposed, which includes an effective discrete encoding scheme of harmony, a new initialization method for harmony memory based on opposition-based learning strategy, a dynamic harmony memory considering rate parameter and a local search strategy, which demonstrates the superiority of proposed algorithm for solving automated guided vehicle scheduling problem obviously.
Journal ArticleDOI
Sequencing and batching for two classes of jobs with deadlines and setup times
TL;DR: A general sequencing problem that includes two classes of jobs with setup times, setup costs, holding costs, and deadlines is formulated that is unique in its explicit recognition of the opportunities to exploit productive capacity increases due to batching.
Journal ArticleDOI
A new dynamic programming algorithm for the parallel machines total weighted completion time problem
Chung Yee Lee,Reha Uzsoy +1 more
TL;DR: This work presents an alternative dynamic programming algorithm with pseudopolynomial complexity for the problem of minimizing total weighted completion time on parallel identical machines that is polynomial in the sum of all job weights.
Journal ArticleDOI
A multi-objective optimisation model to integrating flexible process planning and scheduling based on hybrid multi-objective simulated annealing
TL;DR: In this paper, a mixed integer linear programming (MILP) scheduling model is presented, that is to say a slot-based multi-objective multi-product, that readily accounts for sequence-dependent preparation times (transition and set up times or machine changeover time).
Journal ArticleDOI
An investigation on a two-agent single-machine scheduling problem with unequal release dates
TL;DR: This paper addresses a two-agent scheduling problem on a single machine with arbitrary release dates, where the objective is to minimize the tardiness of one agent, while keeping the lateness of the other agent below or at a fixed level Q.