Author
Listed:
- Adèle Louis
- Gülgün Alpan
- Bernard Penz
- Alain Benichou
Abstract
In the automotive industry, a great challenge of production scheduling is to sequence cars on assembly lines. Among a wide variety of scheduling approaches, academics and manufacturers pay close attention to two specific models: Mixed-Model Sequencing (MMS) and Car Sequencing (CS). Whereas MMS explicitly considers the assembly line balance, CS operates with sequencing rules to find the best car sequence fulfilling the assembly plant requirements, like minimising work overload for assembly workers. Meanwhile, automakers including Renault Group are increasingly willing to consider other requirements, like end-to-end supply chain matters, in production planning and scheduling. In this context, this study compares MMS- and CS-feasible solution spaces to determine which workload-oriented sequencing model would be the most appropriate to later integrate new optimisation. We introduce two exact methods based on Dynamic Programming to assess the gap between both models. Numerical experiments are carried out on real-life manufacturing features from a Renault Group assembly plant. They show that MMS generates more feasible sequences than CS regardless of the sequencing rule calculation method. Only the sequencing rules used by real-life production schedulers result in a higher number of distinct feasible sequences for CS, highlighting that the plant might select a sequence with work overload situations.
Suggested Citation
Adèle Louis & Gülgün Alpan & Bernard Penz & Alain Benichou, 2023.
"Mixed-model sequencing versus car sequencing: comparison of feasible solution spaces,"
International Journal of Production Research, Taylor & Francis Journals, vol. 61(10), pages 3415-3434, May.
Handle:
RePEc:taf:tprsxx:v:61:y:2023:i:10:p:3415-3434
DOI: 10.1080/00207543.2022.2082896
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:61:y:2023:i:10:p:3415-3434. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.