Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
A new approach to solving realistic car assembly scheduling problems for mixed model assembly line is presented. It is proposed to decompose the problem into two subproblems: 1) a sequencing problem that generates admissible car sequences fulfilling capacity constraints for all car models in the production plan, 2) a scheduling problem that determines an admissible car sequence with shortest makespan. The details of this approach are illustrated by a simple numerical example.
Czasopismo
Rocznik
Tom
Strony
355--365
Opis fizyczny
Bibliogr. 7 poz., rys., tab.
Twórcy
autor
- General Motors Manufacturing Poland, Gliwice.
autor
- University of Economics in Katowice, Poland
Bibliografia
- [1] K. R. Baker and D. Trietsvch: Principles of Sequencing and Scheduling. John Wiley and Sons, Hoboken, 2009.
- [2] Ph. Baptiste, C. Le Pape and W. Nuijten: Constraint-Based Scheduling. Kluwer Academic Publishers, Boston, 2001.
- [3] M. Dincbas, H. Simonis and P. van Hentenryck: Solving the carsequencing problem in constraint logic programming. Proc. of the ECAI, (1988), 290-295.
- [4] H. Ford and S. Crowter: Mein Leben und Werk. Unter Mitwirkung von Samuel Crowther. Leipzig, 1923.
- [5] S. French: Sequencing and Scheduling: An Introduction to the Mathematics of Job-Shop. Ellis Horwood, 1982.
- [6] A. Joly and Y. Frein: Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives. Computers & Industrial Engineering, 55 (2008), 295-310.
- [7] C. Solnon, V. Cung, A. Ngyuen and C. Artigues: The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF’2005 challenge problem. European J. of Operational Research, 191 (2008), 912-927.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-0165b658-4a70-40ee-9d1a-d2feb0e17025