Pages that link to "Item:Q1178530"
From MaRDI portal
The following pages link to The complexity of shop-scheduling problems with two or three jobs (Q1178530):
Displaying 36 items.
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- V-shop scheduling (Q795725) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- Job-shop scheduling with multi-purpose machines (Q1174353) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Heuristics for short route job shop scheduling problems (Q1298692) (← links)
- Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function (Q1310024) (← links)
- Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
- The complexity of cyclic shop scheduling problems (Q1607980) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- New complexity results for shop scheduling problems with agreement graphs (Q2232609) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
- Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
- Complexity of the job insertion problem in multi-stage scheduling (Q2467449) (← links)
- Two-Machine Super-Shop Scheduling Problem (Q3978740) (← links)
- Short Shop Schedules (Q4367253) (← links)
- The Machine Duplication Problem in a Job Shop with Two Jobs (Q5689969) (← links)
- An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents (Q6087487) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)