scientific article; zbMATH DE number 1775452

zbMATH Open1027.68512MaRDI QIDQ4542585FDOQ4542585

Authors: Christian Scheideler, Uriel Feige 

Publication date: 17 September 2002

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

Recommendations

• scientific article; zbMATH DE number 2044495
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling
• Job shop scheduling with unit length tasks: bounds and algorithms
• Short Shop Schedules
• Job shop scheduling with unit length tasks

zbMATH Keywords

acyclic job shop scheduling problems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (11)

• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• On the drift of short schedules.
• Scheduling on unrelated machines under tree-like precedence constraints
• On the power of randomization for job shop scheduling withk-units length tasks
• Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net
• Scheduling problems over network of machines
• Solving the job-shop scheduling problem optimally by dynamic programming
• Scheduling problems over a network of machines
• Approximation Algorithms for Generalized Path Scheduling
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• A genetic algorithm for the flexible job-shop scheduling problem

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