Pages that link to "Item:Q3893644"
From MaRDI portal
The following pages link to Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times (Q3893644):
Displaying 50 items.
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness (Q306084) (← links)
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← 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)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
- A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
- A zero-inventory production and distribution problem with a fixed customer sequence (Q940901) (← links)
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- A note on minimizing maximum lateness in a one-machine sequencing problem with release dates (Q1065705) (← links)
- Average and worst-case analysis of heuristics for the maximum tardiness problem (Q1080771) (← links)
- A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← 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)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← 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)
- Online scheduling on a single machine with grouped processing times (Q1723520) (← 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)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- A sequencing problem with family setup times (Q1917311) (← links)
- An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773) (← 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)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery (Q2039713) (← 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)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← 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)
