Scheduling alternative operations in two-machine flow-shops

DOI10.1057/palgrave.jors.2600397zbMath0882.90072OpenAlexW2062643432MaRDI QIDQ4347419

No author found.

Publication date: 7 August 1997

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600397

zbMATH Keywords

branch-and-boundmakespantwo-machine flow-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop ⋮ A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine ⋮ A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application ⋮ Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times ⋮ Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

This page was built for publication: Scheduling alternative operations in two-machine flow-shops