Abstract
AbstractThis paper addresses the class of permutation flow shop scheduling where jobs, after their completion, must be grouped in batches. This is a common scheme in industrial environments, where products undergo multiple process steps in different shops and, when completed, must be transported to customers or the next production step. A new optimisation criterion is used, the inter-exit time, i.e., the difference between the completion times of two jobs. An upper bound is proposed and demonstrated for a general permutation flow shop with m machines.
Publisher
Springer Science and Business Media LLC
Reference32 articles.
1. Agnetis, A. (1997). No-wait flow shop scheduling with large lot sizes. Annals of Operations Research, 70, 415–438.
2. Agnetis, A., Aloulou, M. A., & Fu, L. L. (2014). Coordination of production and interstage batch delivery with outsourced distribution. European Journal of Operational Research, 238, 130–142.
3. Angius, A., Horvát, A., & Urgo, M. (2016). Calculating the joint distribution of n batch delivery spans in a stochastic permutation flow-shop.
4. Buergin, J., Blaettchen, P., Kronenbitter, J., Molzahn, K., Schweizer, Y., Strunz, C., Almagro, M., Bitte, F., Ruehr, S., Urgo, M., & Lanza, G. (2019). Robust assignment of customer orders with uncertain configurations in a production network for aircraft manufacturing. International Journal of Production Research, 57, 749–763. https://doi.org/10.1080/00207543.2018.1482018
5. Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58, 130–148.