scientific article
From MaRDI portal
zbMath0474.68056MaRDI QIDQ3929047
Alexander H. G. Rinnooy Kan, Eugene L. Lawler, Jan Karel Lenstra
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel machinessingle machinepolynomial-time algorithmflow shopopen shopjob shopworst-case analysisNP-hardnessdeterministic scheduling
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Analysis of scheduling problems with typed task systems, An evolutionary algorithm for the vehicle routing problem with route balancing, A survey of scheduling with controllable processing times, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, On a scheduling problem in a robotized analytical system, `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders, Is a unit-job shop not easier than identical parallel machines?, Preemptive scheduling to minimize mean weighted flow time, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Minimizing mean weighted execution time loss on identical and uniform processors, Minimizing the number of tardy jobs with precedence constraints and agreeable due dates, Scheduling independent 2-processor tasks to minimize schedule length, First fit decreasing scheduling on uniform multiprocessors, Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
