References of "Journal of Scheduling"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailThroughput optimization in two-machine flowshops with flexible operations
Crama, Yves ULg; Gultekin, Hakan

in Journal of Scheduling (2010), 13(3), 227-243

In this study, a two-machine flowshop producing identical parts is considered. Each of the identical parts is assumed to require a number of manufacturing operations, and the machines are assumed to be ... [more ▼]

In this study, a two-machine flowshop producing identical parts is considered. Each of the identical parts is assumed to require a number of manufacturing operations, and the machines are assumed to be flexible enough to perform different operations. Due to economical or technological constraints, some specific operations are preassigned to one of the machines. The remaining operations, called flexible operations, can be performed on either one of the machines, so that the same flexible operation can be performed on different machines for different parts. The problem is to determine the assignment of the flexible operations to the machines for each part, with the objective of maximizing the throughput rate. We consider various cases regarding the number of parts to be produced and the capacity of the buffer between the machines. We present solution methods for each variant of the problem. [less ▲]

Detailed reference viewed: 47 (6 ULg)
Full Text
Peer Reviewed
See detailCyclic scheduling in 3-machine robotic flow shops
Crama, Yves ULg; Van de Klundert, Joris

in Journal of Scheduling (1999), 2

We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of ... [more ▼]

We consider a robotic flow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a fixed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production of exactly one part. It has been conjectured that 1-unit cycles yield optimal production rates for 3-machine robotic flow shops. We establish the validity of this conjecture. [less ▲]

Detailed reference viewed: 16 (1 ULg)