A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria

DOI10.1080/00207549408957083zbMath0904.90076OpenAlexW2168397479MaRDI QIDQ4394375

Chandrasekharan Rajendran

Publication date: 11 June 1998

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549408957083

zbMATH Keywords

heuristicflowshopflowshop schedulingflowline-based manufacturing cell

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems, 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 of flowshop group scheduling literature, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines, A bicriteria flowshop scheduling with a learning effect, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, Multicriteria scheduling problems: a survey, An improved genetic algorithm for the flowshop scheduling problem, A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness, Scheduling in cellular manufacturing systems: an heuristic approach, Heuristics for scheduling in a flow shop with multiple processors, Flowshop-scheduling problems with makespan criterion: a review, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, Some results of the worst-case analysis for flow shop scheduling, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, A comparative study of dispatching rules in dynamic flowshops and jobshops, The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

Cites Work

• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A new heuristic method for the flow shop sequencing problem
• A new heuristic for the n-job, M-machine flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem