Pages that link to "Item:Q4198060"
From MaRDI portal
The following pages link to Computational Complexity of Discrete Optimization Problems (Q4198060):
Displayed 40 items.
- Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172) (← links)
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- Job shop scheduling with unit time operations under resource constraints and release dates (Q1098767) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- Minimizing maximum lateness in a two-machine unit-time job shop (Q1151033) (← links)
- Scheduling subject to nonrenewable-resource constraints (Q1169397) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← 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 processing alternatives. (Q1410614) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic (Q1848643) (← links)
- Adaptive temperature control for simulated annealing: a comparative study (Q1886508) (← links)
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs (Q1887796) (← 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)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles (Q3533189) (← links)
- On the power of randomization for job shop scheduling with<i>k</i>-units length tasks (Q3625688) (← links)
- The robot sequencing problem: polynomial algorithm and complexity (Q3713849) (← links)