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

DOI10.1080/00207549408957083zbMATH Open0904.90076OpenAlexW2168397479MaRDI QIDQ4394375FDOQ4394375

Authors: 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

Recommendations

• Heuristics for scheduling in flowshop with multiple objectives
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan

zbMATH Keywords

heuristicflowshop schedulingflowshopflowline-based manufacturing cell

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

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

This page was built for publication: A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394375)