Showing 1 - 10 of 97
The paper deals with the two most important mathematical models for sequencing products on a mixed-model assembly line in order to minimize work overload the mixed-model sequencing (MMS) model and the car sequencing (CS) model. Although both models follow the same underlying objective, only MMS...
Persistent link: https://www.econbiz.de/10011097841
paper treats the scheduling of the part supply processes within line-integrated supermarkets. The scheduling problem for …
Persistent link: https://www.econbiz.de/10010906811
Nowadays, mixed-model assembly lines are applied in a wide range of industries to mass-produce customized products to order, e.g., in automobile industry. An important decision problem in this context receiving a lot of attention from researchers and practitioners is the sequencing problem,...
Persistent link: https://www.econbiz.de/10010871103
With the ongoing trend of mass-customization and an increasing product variety, just-in-time part logistics more and more becomes one of the greatest challenges in today’s automobile production. Thousands of parts and suppliers, a multitude of different equipments, and hundreds of logistics...
Persistent link: https://www.econbiz.de/10011117459
, partitioning stations to be supplied among tow trains, and scheduling, i.e., deciding on the start times of each tow train’s tours …
Persistent link: https://www.econbiz.de/10010577566
This paper addresses scheduling models in which a contribution of an individual job to the objective function is …. Besides, the same approach works for the models with no prior history of study, e.g., parallel machine scheduling with …
Persistent link: https://www.econbiz.de/10010597599
The paper investigates a problem faced by a make-to-order (MTO) firm that has the ability to reject or accept orders, and set prices and lead-times to influence demands. Inventory holding costs for early completed orders, tardiness costs for late delivery orders, order rejection costs,...
Persistent link: https://www.econbiz.de/10010597612
Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest …
Persistent link: https://www.econbiz.de/10010597618
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.
Persistent link: https://www.econbiz.de/10010597659
We consider the ordinary NP- hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. We present an O(n2) algorithm for the problem when the machines are ordered, that is, when each job has its smaller...
Persistent link: https://www.econbiz.de/10010597692