Narrow search
Showing 1 - 10 of 176,999
Cover Image
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects
Soper, Alan J.; Strusevič, Vitalij Aleksandrovič - In: Journal of scheduling : JOS 23 (2020) 6, pp. 665-680
Persistent link: https://www.econbiz.de/10012417552
Cover Image
Scheduling jobs with a V-shaped time-dependent processing time
Sedding, Helmut A. - In: Journal of scheduling : JOS 23 (2020) 6, pp. 751-768
Persistent link: https://www.econbiz.de/10012417630
Cover Image
Scheduling robotic cells with fixed processing times or time windows : classification, solution approaches, polynomial algorithms and complexity
Feng, Jianguang; Che, Ada; Chu, Chengbin; Levner, Eugene; … - In: European journal of operational research : EJOR 319 (2024) 2, pp. 468-483
Persistent link: https://www.econbiz.de/10015084850
Cover Image
Heuristics for an integrated maintenance and production scheduling problem on parallel machines with stochastic failures and non-resumable jobs
Hoyningen-Huene, Wiebke von - 2015
, three construction heuristics and an Ant Colony System (ACS) algorithm are developed for solving this integrated problem …
Persistent link: https://www.econbiz.de/10011305782
Cover Image
An exact algorithm for parallel machine scheduling with conflicts
Kowalczyk, Daniel; Leus, Roel - 2015
Persistent link: https://www.econbiz.de/10010485486
Cover Image
Minimizing Makespan in Flowshops with Pallet Requirements : Computational Complexity
Wang, M. W. - 2010
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...
Persistent link: https://www.econbiz.de/10013152472
Cover Image
Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets
Chu, Chengbin - 2017
A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...
Persistent link: https://www.econbiz.de/10012746785
Cover Image
New results for an open time-dependent scheduling problem
Gawiejnowicz, Stanisław; Kurc, Wiesław - In: Journal of scheduling : JOS 23 (2020) 6, pp. 733-744
Persistent link: https://www.econbiz.de/10012417627
Cover Image
Multi-Stage assembly flow shop with setup time and release time
Sheikha, Shaya; Komakib, G. M.; Kayvanfarc, Vahid; … - In: Operations research perspectives 6 (2019), pp. 1-15
lower bounds as well as nine efficient heuristics for solving the problem with the objective of minimizing makespan. The … randomly generated instances indicates that GVNS outperforms other heuristics. The performance of proposed heuristics and meta-heuristics …
Persistent link: https://www.econbiz.de/10012029504
Cover Image
Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization...
Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali - In: Journal of industrial engineering and management : JIEM 10 (2017) 5, pp. 887-918
Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop...
Persistent link: https://www.econbiz.de/10011920773