A parallel shortest augmenting path algorithm for the assignment problem
Journal of the ACM (JACM)
Sequencing JIT mixed-model assembly lines
Management Science
Level schedules for mixed-model, Just-in-Time processes
Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Combining heuristic procedures and simulation models for balancing a PC camera assembly line
Computers and Industrial Engineering
A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
Mathematical and Computer Modelling: An International Journal
A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems
Operations Research Letters
A novel heuristic approach for job shop scheduling problem
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Population-based dynamic scheduling optimisation for complex production process
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
Mixed-model manufacturing systems are widely used by companies, in order to meet the customers' demand for a variety of products, in an efficient way. This paper is concerned with a special class of mixed-model manufacturing systems: flow-shops. In a flow-shop, each product has to be processed by a number of machines, following a common route. We study the production smoothing problem under presence of non-zero setup and processing times which also vary among the products. We split the master problem into two sub-problems which are concerned with determining the batch sizes and production sequences, respectively. We develop a dynamic programming procedure to solve the batching problem, and suggest using an existing method from the current literature to solve the sequencing problem. We conduct a computational study and show that our solution approach is effective in meeting the JIT goals and efficient in its computational requirements.