Pages that link to "Item:Q1897385"
From MaRDI portal
The following pages link to An efficient algorithm for a job shop problem (Q1897385):
Displaying 12 items.
- An efficient algorithm for the job-shop problem with two jobs (Q1108919) (← links)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
- Total completion time minimization in two-machine job shops with unit-time operations (Q1278312) (← links)
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482) (← 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)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)
- (Q3023691) (← links)
- (Q3824095) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)