scientific article; zbMATH DE number 3744543

MaRDI QIDQ3929047zbMATH OpenFDO

Authors Alexander H. G. Rinnooy Kan, Eugene L. Lawler, Jan Karel Lenstra

Publication date 1981

zbMATH Keywords

deterministic schedulingflow shopjob shopNP-hardnessopen shopparallel machinespolynomial-time algorithmsingle machineworst-case analysis

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(14)

• First fit decreasing scheduling on uniform multiprocessors
• Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Capacitated two-parallel machines scheduling to minimize sum of job completion times
• Analysis of scheduling problems with typed task systems
• Is a unit-job shop not easier than identical parallel machines?
• On a scheduling problem in a robotized analytical system
• An evolutionary algorithm for the vehicle routing problem with route balancing
• A survey of scheduling with controllable processing 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
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
• Scheduling independent 2-processor tasks to minimize schedule length
• Preemptive scheduling to minimize mean weighted flow time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929047)