Showing 1 - 10 of 10
We study the recently identified class of generalized due date scheduling problems. These are machine scheduling problems for which due dates are specified according to the position in which a job is completed, rather than the identity of that job. Flexible manufacturing environments and public...
Persistent link: https://www.econbiz.de/10012746788
Persistent link: https://www.econbiz.de/10003869991
A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...
Persistent link: https://www.econbiz.de/10012746786
Persistent link: https://www.econbiz.de/10012796945
Persistent link: https://www.econbiz.de/10014533645
We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each part is processed by at most one machine in...
Persistent link: https://www.econbiz.de/10014219051
This paper considers the problem of scheduling operations in bufferless robotic cells that produce identical parts. Finding a cyclic solution that minimizes the long-run average time to produce a part has long been a fundamental open problem. Most research has been focused on finding an optimal...
Persistent link: https://www.econbiz.de/10014138523
We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [...
Persistent link: https://www.econbiz.de/10012746789
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of review. Here we focus on a flexible job shop scheduling problem of minimizing the makespan in a two-center job shop, where the first center consists of one machine and the second...
Persistent link: https://www.econbiz.de/10012838656
This article considers the problems of scheduling operations in single-gripper and dual-gripper bufferless robotic cells in which the arrangement of machines is circular. The cells are designed to produce identical parts under the free-pickup criterion with additive intermachine travel time. The...
Persistent link: https://www.econbiz.de/10014036447