Pages that link to "Item:Q1364482"
From MaRDI portal
The following pages link to A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482):
Displaying 19 items.
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- A note on ``Scheduling unit-time tasks with integer release times and deadlines'' (Q689642) (← links)
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
- Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length (Q1062615) (← links)
- Job shop scheduling with unit time operations under resource constraints and release dates (Q1098767) (← links)
- An efficient algorithm for the job-shop problem with two jobs (Q1108919) (← links)
- Total completion time minimization in two-machine job shops with unit-time operations (Q1278312) (← links)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- An efficient algorithm for a job shop problem (Q1897385) (← links)
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)
- How to make Brucker's algorithm polynomial: Scheduling by periodization (Q2784177) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals (Q3313599) (← links)