Computer-Aided complexity classification of combinational problems
From MaRDI portal
Publication:3953190
DOI10.1145/358690.363066zbMath0491.68070OpenAlexW2003305391MaRDI QIDQ3953190
Alexander H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra, Eugene L. Lawler
Publication date: 1982
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358690.363066
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Discrete mathematics in relation to computer science (68R99)
Related Items
Machine scheduling with earliness, tardiness and non-execution penalties, SCHEDULING INTERVAL ORDERS IN PARALLEL, Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time, Scheduling identical jobs on uniform parallel machines, Developing feasible and optimal schedules of jobs on one machine, A classification scheme for vehicle routing and scheduling problems, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, The job shop scheduling problem: Conventional and new solution techniques, New directions in scheduling theory
