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

DOI10.1057/jors.1989.159zbMath0682.90049MaRDI 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 bounds; NP-hard; heuristic; two-machine flow-shop; minimum finish-time schedule

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling linearly shortening jobs under precedence constraints, Total completion time in a two-machine flowshop with deteriorating tasks, Conjugate problems in time-dependent scheduling, Job lateness in a two-machine flowshop with setup times separated, 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, A review of TSP based approaches for flowshop scheduling, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM