Bounding algorithm for the routing problem with arbitrary paths and alternative servers
From MaRDI portal
Publication:3798471
DOI10.1007/BF01068694zbMath0652.90057MaRDI QIDQ3798471
Publication date: 1986
Published in: Cybernetics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
On some geometric methods in scheduling theory: A survey, APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS, A fluid approach to large volume job shop scheduling, Approximation schemes for job shop scheduling problems with controllable processing times, Scheduling jobshops with some identical or similar jobs, On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion, Sevast'yanov's algorithm for the flow-shop scheduling problem, Approximability of flow shop scheduling, Flexible flow shop scheduling with uniform parallel machines
Cites Work
