Pages that link to "Item:Q1893158"

The following pages link to NP-hardness of shop-scheduling problems with three jobs (Q1893158):

Displaying 30 items.

• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540) (← links)
• Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
• Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
• A job-shop problem with one additional resource type (Q640303) (← links)
• Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
• Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
• A neural network algorithm for servicing jobs with sequential and parallel machines (Q893921) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
• On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
• Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
• Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
• Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
• Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
• Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing (Q2104772) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
• Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
• Job-shop scheduling in a body shop (Q2434313) (← links)
• Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
• Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
• A graph-based constraint programming approach for the integrated process planning and scheduling problem (Q2668705) (← links)
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
• Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)
• An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents (Q6087487) (← links)
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)
• Two-machine job-shop scheduling with one joint job (Q6153460) (← links)