Job Shop Scheduling with Unit Processing Times
From MaRDI portal
(Redirected from Publication:5387985)
Recommendations
Cited in
(19)- Practical job shop scheduling
- Job shop scheduling with deadlines
- Job-shop scheduling with processing alternatives.
- Scheduling problems over a network of machines
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- A grasp for job shop scheduling
- Job shop scheduling with unit length tasks
- Job shop scheduling with unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- 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?)
- Scheduling problems over network of machines
- Job shop scheduling with unit length tasks: bounds and algorithms
- Equitable scheduling on a single machine
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
- High-multiplicity cyclic job shop scheduling
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 Q5387985)
