Narrow search
Showing 1 - 10 of 105
Cover Image
Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost
Rocholl, Jens; Mönch, Lars; Fowler, John - In: Journal of business economics : JBE 90 (2020) 9, pp. 1345-1381
Persistent link: https://www.econbiz.de/10012316363
Cover Image
Trajectory scheduling methods for minimizing total tardiness in a flowshop
Li, Xiaoping; Chen, Long; Xu, Haiyan; Gupta, Jatinder N. - In: Operations research perspectives 2 (2015), pp. 13-23
composite heuristics are introduced, which exploit the search space with a strong intensification effect. Based on purely … combinations of composite heuristics. Both the best and worst combinations are compared with three best existing sequential meta-heuristics … for the considered problem on 540 benchmark instances. Experimental results show that the proposed heuristics …
Persistent link: https://www.econbiz.de/10011822464
Cover Image
Genetic based algorithms to solving multi-quays berth allocation problem with setup time constraints
Sangsawang, Chatnugrob; Longploypad, Cholthida - In: LogForum : elektroniczne czasopismo naukowe z dziedziny … 18 (2022) 4, pp. 505-515
Persistent link: https://www.econbiz.de/10013479390
Cover Image
Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times
Kodaganallur, Viswanathan; Sen, Anup K.; Mitra, Subrata - 2011
Persistent link: https://www.econbiz.de/10009379486
Cover Image
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
Cover Image
A review and classification on distributed permutation flowshop scheduling problems
Perez-Gonzalez, Paz; Framinan, Jose M. - In: European journal of operational research : EJOR 312 (2024) 1, pp. 1-21
Persistent link: https://www.econbiz.de/10014456196
Cover Image
Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints
Schnabel, André; Kellenbrink, Carolin; Helber, Stefan - 2017
established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we … its makespan increases and try to find a schedule with a profit-maximizing makespan. Like the RCPSP, the problem is NP …
Persistent link: https://www.econbiz.de/10011655297
Cover Image
Incorporating gender and age in genetic algorithms to solve the indexing problem
Ghosh, Diptesh - 2016
Persistent link: https://www.econbiz.de/10011471367
Cover Image
A new metaheuristic genetic-based placement algorithm for 2D strip packing
Thomas, Jaya; Chaudhari, Narendra S. - In: Journal of industrial engineering international 10 (2014), pp. 1-16
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex...
Persistent link: https://www.econbiz.de/10011556427
Cover Image
A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F. - In: Journal of industrial engineering international 10 (2014), pp. 1-9
developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect …
Persistent link: https://www.econbiz.de/10011556480