Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time

DOI10.1057/jors.1989.159zbMath0682.90049OpenAlexW2042475341MaRDI QIDQ4732296

No author found.

Publication date: 1989

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

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

zbMATH Keywords

worst-case boundsNP-hardheuristictwo-machine flow-shopminimum finish-time schedule

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

Single machine scheduling with start time dependent processing times: Some solvable cases ⋮ A variant of the permutation flow shop model with variable processing times ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ Scheduling linearly shortening jobs under precedence constraints ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Conjugate problems in time-dependent scheduling ⋮ A review of TSP based approaches for flowshop scheduling