Similar Search Results

A branch and bound algorithm for the response time variability problem

García-Villoria, Alberto; Corominas, Albert; Delorme, … - In: Journal of scheduling 16 (2013) 2, pp. 243-252

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

A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop

Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10

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

Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects

Soroush, H. M. - In: European journal of industrial engineering : EJIE 6 (2012) 5, pp. 596-628

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

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

Ronconi, Débora P.; Henriques, Luís R. S. - In: Omega : the international journal of management science 37 (2009) 2, pp. 272-281

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

No-wait flowshop scheduling problem with two criteria : total tardiness and makespan

Allahverdi, Ali; Aydilek, Harun; Aydilek, Asiye - In: European journal of operational research : EJOR 269 (2018) 2, pp. 590-601

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

Some new clique inequalities in four-index hub location models

Landete, Mercedes; Peiró, Juanjo - In: European journal of operational research : EJOR 318 (2024) 3, pp. 768-777

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

A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems

Chung, Chia-Shin; Flynn, James; Rom, Walter; … - 2013

The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA,...

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

Reducing tardy batches by seru production : model, exact solution, cooperative coevolution solution, and insights

Li, Xiaolong; Yu, Yang; Sun, Wei; Tang, Jiafu - In: Computers & operations research : and their … 160 (2023), pp. 1-15

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

A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work

Min, Yunhong; Choi, Byung-Cheon; Park, Myoung-Ju; Kim, … - In: 4OR : quarterly journal of the Belgian, French and … 21 (2023) 3, pp. 421-437

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

Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects

Zhang, Yurong; Sun, Xinyu; Liu, Tao; Wang, Jiayin; … - In: Journal of the Operational Research Society 76 (2025) 3, pp. 528-540

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