Multiprocessor task scheduling in multistage hyrid flowshops: a genetic algorithm approach [PDF]
, 2004 This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage.
Davis L +6 more
core +1 more source
Frontiers in Applied Mathematics and StatisticsScheduling is one of the many skills required for advancement in today’s modern industry. The flow-shop scheduling problem is a well-known combinatorial optimization challenge. Scheduling issues for flow shops are NP-hard and challenging.
Shakuntla Singla +4 more
doaj +1 more source
UET flow shop scheduling with delays [PDF]
RAIRO - Theoretical Informatics and Applications, 1996 Summary: F\(|\)UET, delays \(|C_{\max}\) is introduced and shown to be NP-complete.
Rayward-Smith, V. J., Rebaine, D.
openaire +1 more source
Resource Speed Optimization for Two-Stage Flow-Shop Scheduling [PDF]
, 2015 Multiple resource co-scheduling algorithms and pipelined execution models are becoming increasingly popular, as they better capture the heterogeneous nature of modern architectures.
Alessandra Melani +4 more
core
Sequencing CONWIP flow-shops: Analysis and heuristics [PDF]
In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CON\VIP production control system with the objective to minimise the make span We characterise the problem and analyse its similarities and differences with the ...
Framiúnan, Jose M. +2 more
core
Modelling and solving train scheduling problems under capacity constraints [PDF]
, 2008 Many large coal mining operations in Australia rely heavily on the rail network to transport coal from mines to coal terminals at ports for shipment. Over the last few years, due to the fast growing demand, the coal rail network is becoming one of the ...
Liu, Shi-Qiang
core +1 more source
Robust dynamic schedule coordination control in the supply chain [PDF]
, 2016 International audienceCoordination plays crucial role in supply chain management. In this paper, we extend the existing body of literature on supply chain coordination by representing a robust schedule coordination approach.
Dolgui, Alexandre +2 more
core +3 more sources
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics [PDF]
, 2018 This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial
Fernández-Viagas Escudero, Víctor +2 more
core
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks [PDF]
, 2011 This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense.
A. Ben Hmida +13 more
core +2 more sources
A Simultaneous Worker Assignment and Scheduling Problem to Minimize Makespan in Flexible Flow Shop via Metaheuristic Approaches [PDF]
International Journal of Industrial Engineering and Production Research, 2019 In many real scheduling situations, it is necessary to deal with the worker assignment and job scheduling together. However, in traditional scheduling problems, only the machine is assumed to be a constraint and there isn’t any constraint about workers ...
Ebrahim Asadi-Gangraj +2 more
doaj +1 more source