A Two-stage approach for an optimum solution of the car assembly scheduling problem Part 1. Problem statement, solution outline and tutorial example
Mazur Michał, Niederliński Antoni
Archives of Control Sciences · 2015
doi:10.1515/acsc-2015-0023 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.