Sequencing CONWIP flow-shops: Analysis and heuristics

DOI10.1080/00207540110048972MaRDI QIDQ4674420zbMATH OpenOpenAlexFDO

Authors Jose M. Framinan, Rafael Ruiz-Usano, Rainer Leisten

Publication date 11 May 2005

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

Full work available at URL http://hdl.handle.net/10419/48887

zbMATH Keywords

heuristicsflow-shop problembacklog sequencing problemproduction control system

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Production models (90B30)

Recommendations

• Some efficient heuristic methods for the flow shop sequencing problem
• A high quality solution constructive heuristic for flow shop sequencing
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• A new heuristic method for the flow shop sequencing problem
• scientific article; zbMATH DE number 2156294
• Sequencing and scheduling in flowshops with task redistribution
• scientific article; zbMATH DE number 7145128
• Special class of flowshop sequencing problems
• Flow shop batching and scheduling with sequence-dependent setup times
• Two models for a family of flowshop sequencing problems

Cited in

(7)

• Sequencing and loading of products on a flowline
• A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
• Flow shops with WIP and value added costs
• Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
• Scheduling in flowshops to minimize total tardiness of jobs
• Facility layout based on sequence analysis: design of flowshops
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

This page was built for publication: Sequencing CONWIP flow-shops: Analysis and heuristics

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