Pages that link to "Item:Q1083026"

The following pages link to A block approach for single-machine scheduling with release dates and due dates (Q1083026):

Displaying 41 items.

• Developing feasible and optimal schedules of jobs on one machine (Q380659) (← links)
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
• On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
• Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
• New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
• Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
• A two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
• Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
• A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
• Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
• Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
• A production rescheduling expert simulation system (Q1577764) (← links)
• Sequencing of jobs in some production system (Q1582040) (← links)
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
• A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
• Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
• A sequencing problem with family setup times (Q1917311) (← links)
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
• A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
• Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
• Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← links)
• Improving earliest starting times in machine scine scheduling problem (Q3835660) (← links)
• A genetic algorithm methodology for complex scheduling problems (Q4239710) (← links)
• An exact block algorithm for no-idle RPQ problem (Q4971711) (← links)
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)