A multi-stage parallel-processor flowshop problem with minimum flowtime
From MaRDI portal
Publication:1197966
DOI10.1016/0377-2217(92)90310-6zbMath0767.90040OpenAlexW2062123760MaRDI QIDQ1197966
Dipak Chaudhuri, Chandrasekharan Rajendran
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90310-6
branch-and-boundheuristic algorithmNP-completeflowshop schedulingparallel processorstotal flowtimetwo-stage parallel- processor flowshop
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A discrete inter-species cuckoo search for flowshop scheduling problems, A taxonomy of flexible flow line scheduling procedures, An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model, Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach, Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations, A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines, Modeling realistic hybrid flexible flowshop scheduling problems, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, A flexible flowshop problem with total flow time minimization, The hybrid flow shop scheduling problem, Metaheuristic algorithms for the hybrid flowshop scheduling problem, Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic, Preemptive hybrid flowshop scheduling problem of interval orders, Steel-making process scheduling using Lagrangian relaxation, A genetic algorithm for the proportionate multiprocessor open shop, Heuristics for scheduling in a flow shop with multiple processors, Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, Conceptual framework for lot-sizing and scheduling of flexible flow lines, Branch and bound crossed with GA to solve hybrid flowshops, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, The hot strip mill production scheduling problem: A tabu search approach
Cites Work
