scientific article; zbMATH DE number 3889254

zbMATH Open0557.90044MaRDI QIDQ3221735FDOQ3221735

Authors: Alexander H. G. Rinnooy Kan, Jan Karel Lenstra 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2001585
• Principles of Sequencing and Scheduling
• scientific article; zbMATH DE number 4076943
• scientific article; zbMATH DE number 2146482
• Scheduling. Theory, algorithms, and systems.

zbMATH Keywords

computational complexityprobabilisticschedulingcombinatorial algorithmsequencingworst case analysisanalysisannotated bibliography

Mathematics Subject Classification ID

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) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cited In (12)

• Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• A review of TSP based approaches for flowshop scheduling
• Scheduling tasks on two processors with deadlines and additional resources
• Title not available (Why is that?)
• A decomposition approach for a resource constrained scheduling problem
• CHAIN STRUCTURES IN SCHEDULES TASKS
• Open shops with jobs overlap
• A decomposition approach in a DSS for a resource constrained scheduling problem
• A review of the static, stochastic job sequencing literature
• Complex Scheduling
• Pre-scheduling

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 Q3221735)