Job shop scheduling with unit processing times

MaRDI QIDQ2921672zbMATH OpenFDO

Authors N. Bansal, Maxim Sviridenko, Tracy Kimbrel

Publication date 13 October 2014

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Job Shop Scheduling with Unit Processing Times
• Job shop scheduling with unit length tasks
• Scheduling unit processing time jobs on an m-machine flow-shop
• scientific article; zbMATH DE number 2044496
• scientific article; zbMATH DE number 1086988
• Job shop scheduling with unit time operations under resource constraints and release dates
• Flow shop scheduling jobs with position-dependent processing times
• Job shop scheduling with unit length tasks: bounds and algorithms
• scientific article; zbMATH DE number 2044495
• Job shop scheduling with deadlines

Cited in

(10)

• Job shop scheduling with deadlines
• Job-shop scheduling with processing alternatives.
• Non-clairvoyant weighted flow time scheduling on different multi-processor models
• Job shop scheduling with unit length tasks
• On the power of randomization for job shop scheduling withk-units length tasks
• Improved Approximation Algorithms for Shop Scheduling Problems
• scientific article; zbMATH DE number 2044495 (Why is no real title available?)
• scientific article; zbMATH DE number 1500651 (Why is no real title available?)
• Job Shop Scheduling with Unit Processing Times
• Job shop scheduling with unit length tasks: bounds and algorithms

This page was built for publication: Job shop scheduling with unit processing times

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