Similar Search Results

A two-stage three-machine assembly scheduling problem with deterioration effect

Wu, Chin-Chia; Azzouz, Ameni; Chung, I. Hong; Lin, Win-Chin - In: International journal of production research 57 (2019) 21, pp. 6634-6647

Persistent link: https://www.econbiz.de/10012193771

Minimizing the Sum of Earliness and Tardiness in the Multi-Factory Two-Stage Assembly Scheduling Problem

Kazemi, Hamed; Nourelfath, M.; Gendreau, Michel - 2023

The geographical dispersion of collaborative factories may provide the cost-saving potential for manufacturers and lead them to easier fit the global markets. On the other hand, in such networks of factories, coordination is very important for the just-in-time delivery of orders. This study...

Persistent link: https://www.econbiz.de/10014360834

Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time

Nekoiemehr, N.; Moslehi, G. - In: Journal of the Operational Research Society : OR 62 (2011) 7, pp. 1403-1412

Persistent link: https://www.econbiz.de/10009155412

A competitive exact algorithm for assembly line balancing

Sprecher, Arno - 1997

Persistent link: https://www.econbiz.de/10011787456

Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed

Schaller, Jeffrey; Valente, Jorge - In: Computers & operations research : and their … 109 (2019), pp. 1-11

Persistent link: https://www.econbiz.de/10012065011

An approximate algorithm for a high-multiplicity parallel machine scheduling problem

Filippi, Carlo - In: Operations research letters 38 (2010) 4, pp. 312-317

Persistent link: https://www.econbiz.de/10003984254

Throughput optimization in two-machine flowshops with flexible operations

Crama, Yves; Gultekin, Hakan - In: Journal of scheduling 13 (2010) 3, pp. 227-243

Persistent link: https://www.econbiz.de/10003985025

A note on the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012)

Prot, Damien; Bellenguez-Morineau, Odile; Lahlou, Chams - In: Journal of scheduling 16 (2013) 4, pp. 437-438

Persistent link: https://www.econbiz.de/10009777772

A branche and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

Yao, Shiqing; Jiang, Zhibin; Li, Na - In: Computers & operations research : and their … 39 (2012) 5, pp. 939-951

Persistent link: https://www.econbiz.de/10010217415

A theoretical development for the total tardiness problem and its application in branch and bound algorithm

Zhou, Shuyu; Liu, Zhaohui - In: Computers & operations research : and their … 40 (2013) 1, pp. 248-252

Persistent link: https://www.econbiz.de/10009657960