Pages that link to "Item:Q1108919"

The following pages link to An efficient algorithm for the job-shop problem with two jobs (Q1108919):

Displaying 35 items.

• Online algorithms with advice: the tape model (Q529045) (← links)
• A job-shop problem with one additional resource type (Q640303) (← links)
• Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
• Scheduling co-operating stacking cranes with predetermined container sequences (Q908295) (← links)
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
• Job-shop scheduling with multi-purpose machines (Q1174353) (← links)
• The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← 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)
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths (Q1323959) (← 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)
• The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
• Efficiency of reductions of job-shop to flow-shop problems (Q1582031) (← 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)
• NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
• Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
• An efficient algorithm for a job shop problem (Q1897385) (← links)
• Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
• Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
• A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
• Job-shop scheduling in a body shop (Q2434313) (← links)
• Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
• Job shop scheduling with unit length tasks (Q2905324) (← links)
• Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
• On the power of randomization for job shop scheduling with<i>k</i>-units length tasks (Q3625688) (← links)
• Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
• Job-Shop Scheduling with Mixed Blocking Constraints between Operations (Q5357765) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← 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)