ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
From MaRDI portal
Publication:3898329
DOI10.15807/jorsj.23.118zbMath0451.90074OpenAlexW2184370947MaRDI QIDQ3898329
Shigeji Miyazaki, Noriyuki Nishiyama
Publication date: 1980
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.23.118
algorithmcomputational experienceprecedence relationflow-shop schedulingnear optimal solutionadjacent jobsadjacent pairwise interchange methodminimization of weighted mean flow time
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs ⋮ Heuristic for scheduling in a Kanban system with dual blocking mechanisms ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ Some results of the worst-case analysis for flow shop scheduling
This page was built for publication: ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
