Pages that link to "Item:Q4016707"

The following pages link to Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better (Q4016707):

Displaying 50 items.

• Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
• Resource leveling in a machine environment (Q418090) (← links)
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
• Machine scheduling with deliveries to multiple customer locations (Q707086) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
• Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210) (← links)
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem (Q1273117) (← links)
• Approximability of flow shop scheduling (Q1290640) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
• A note on generalizing the maximum lateness criterion for scheduling (Q1315993) (← links)
• Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
• Heuristics for parallel machine scheduling with delivery times (Q1338896) (← links)
• An open shop scheduling problem with a non-bottleneck machine (Q1371949) (← links)
• A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) (Q1376266) (← links)
• Scheduling with job release dates, delivery times and preemption penalties (Q1603554) (← links)
• Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
• Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
• Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
• Integrated scheduling of production and distribution with release dates and capacitated deliveries (Q1793780) (← links)
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
• A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
• Machine scheduling with job delivery coordination (Q1876146) (← links)
• A sequencing problem with family setup times (Q1917311) (← links)
• Coordinating multi-location production and customer delivery (Q1936790) (← links)
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910) (← links)
• Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
• Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
• A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
• Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
• Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time (Q2434291) (← links)
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
• A best on-line algorithm for single machine scheduling with small delivery times (Q2481972) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
• Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
• Integration of finished goods batch delivery into production scheduling via total tardiness minimization (Q3512025) (← links)
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
• Machine scheduling with transportation considerations (Q5932281) (← links)