Heuristics for hybrid flow shops with controllable processing times and assignable due dates

DOI10.1016/S0305-0548(01)00040-5zbMath0994.90114OpenAlexW2039740342WikidataQ57633939 ScholiaQ57633939MaRDI QIDQ1603337

Jatinder N. D. Gupta, Volker Lauff, Yuri N. Sotskov, Karin Krüger, Frank Werner

Publication date: 11 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00040-5

Mathematics Subject Classification ID

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

Related Items (21)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A survey of scheduling with controllable processing times ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Control methods for dynamic time-based manufacturing under customized product lead times ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ The hybrid flow shop scheduling problem ⋮ A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time ⋮ Improved approximation algorithms for two-stage flexible flow shop scheduling ⋮ Scheduling hybrid flowshop with parallel batching machines and compatibilities ⋮ Approximation algorithms for two-stage flexible flow shop scheduling ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation

Cites Work

• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Survey of scheduling research involving due date determination decisions
• Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
• Multicriteria scheduling problems: a survey
• Sequencing with Earliness and Tardiness Penalties: A Review
• Analytical determination of optimal TWK due-dates in a job shop
• General flow-shop scheduling with resource constraints
• A Survey of Scheduling Rules
• On the application of insertion techniques for job shop problems with setup times

This page was built for publication: Heuristics for hybrid flow shops with controllable processing times and assignable due dates