Mixed-model assembly line scheduling using the Lagrangian relaxation technique

New Developments and Decision-makings in Production and Retailing

“…The third is dynamic programming (Roman 1971;Ibraki and Nakamura 1994;Lorigeon et al 2002;Choi et al 2004), which is also an enumeration technique used to search for an optimal solution among the possible solutions. And the fourth is the relaxation method (Narahari and Srigopal 1996;Zhang et al 2000;Hwang and Chang 2003;Tang and Xuan 2006) which allows a near-optimal solution to be reached with less computation.…”

“…Kaufman (1974) developed an almost optimal algorithm to solve the assembly line scheduling problem in the area of multiprocessor scheduling. Some researchers aimed at scheduling mixed-model assembly lines by using different techniques (Vargas et al 1992;Celano et al 1999;Caridi and Sianesi 2000;Zhang et al 2000;Sawik 2002;Yu et al 2006). Kyparisis and Koulamas (2002) addressed the assembly line scheduling problem with concurrent operations per station and each concurrent operation was performed by a set of identical parallel machines.…”

Intelligent Decision-making Models for Production and Retail Operations

“…The first one is the integer programing method (Foster and Ryan 1976;Graves and Lamar 1983;Pan 1997;Sawik 2004). And the fourth is the relaxation method (Narahari and Srigopal 1996; Zhang et al 2000;Hwang and Chang 2003;Tang and Xuan 2006) which allows a near-optimal solution to be reached with less computation. The third is dynamic programming (Roman 1971;Ibraki and Nakamura 1994;Lorigeon et al 2002;Choi et al 2004), which is also an enumeration technique used to search for an optimal solution among the possible solutions.…”

“…A large number of literature have been published in the field of production scheduling, which focused mostly on the scheduling for various types of production systems at the shop floor or assembly line level, such as job shop scheduling (Adam et al 1993;Fayad and Petrovic 2005;Guo et al 2006;Kondakci and Gupta 1991), flow shop scheduling (Ishibuchi et al 1994;Iyer and Saxena 2004;Morita and Shio 2005;Nagar et al 1996), machine scheduling (Baek and Yoon 2002;Dimopoulos and Zalzala 2001;Fowler et al 2003;Liu and Tang 1999), and assembly line scheduling Kaufman 1974;Vargas et al 1992;Zhang et al 2000). Moreover, have presented a set of scheduling heuristic to solve the order release and order sequencing problem in a single-stage production system.…”

Sequencing mixed-model assembly lines: Survey, classification and model critique

“…Thus, model sequencing might have to regard these due dates of models, for instance, by minimizing the number of late models (see Lovgren and Racer, 2000;Zhang et al, 2000). This presupposes that the model sequence is determined for a comparatively long planning horizon (for an example see Bergen et al, 2001).…”