A note on the flow-shop problem without interruptions in job processing

DOI10.1002/NAV.3800280413zbMATH Open0535.90046OpenAlexW2081422159MaRDI QIDQ3320105FDOQ3320105

Wlodzimierz Szwarc

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280413

zbMATH Keywords

solution methodflow-shop problemoptimization criteriaearliest starting time

Mathematics Subject Classification ID

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

Cited In (8)

• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• A review of TSP based approaches for flowshop scheduling
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• Minimizing total completion time in two-machine flow shops with exact delays
• Title not available (Why is that?)
• A note on scheduling jobs with missing operations in permutation flow shops
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Fitness landscape analysis for the no-wait flow-shop scheduling problem

This page was built for publication: A note on the flow-shop problem without interruptions in job processing

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