Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
From MaRDI portal
Publication:3893644
DOI10.1287/opre.28.6.1436zbMath0447.90041OpenAlexW2086012697MaRDI QIDQ3893644
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.6.1436
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Machine scheduling with job delivery coordination, Integrated production and outbound distribution scheduling problems with job release dates and deadlines, Average and worst-case analysis of heuristics for the maximum tardiness problem, Preemptive scheduling with release dates, delivery times and sequence independent setup times, A block approach for single-machine scheduling with release dates and due dates, Minimizing maximum delivery completion time for order scheduling with rejection, Heuristics for parallel machine scheduling with delivery times, Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem, A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval, Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness, Integrated scheduling problem on a single bounded batch machine with an unavailability constraint, Theoretical expectation versus practical performance of Jackson's heuristic, A sequencing problem with family setup times, An algorithm for single machine sequencing with release dates to minimize maximum cost, An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints, An iterative heuristic for the single machine dynamic total completion time scheduling problem, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery, A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times, Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination, An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown, Coordinating multi-location production and customer delivery, An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times, Joint replenishment meets scheduling, An improved memetic algorithm for integrated production scheduling and vehicle routing decisions, Scheduling Algorithms for Single Machine Problem with Release and Delivery Times, Flow shop scheduling problems with transportation constraints revisited, Integration of finished goods batch delivery into production scheduling via total tardiness minimization, Flow shop scheduling problems with transportation constraints revisited, An improved approximation algorithm for a scheduling problem with transporter coordination, An approximate decomposition algorithm for scheduling on parallel machines with heads and tails, On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time, A survey of results for sequencing problems with controllable processing times, The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine, Online scheduling on a single machine with grouped processing times, A zero-inventory production and distribution problem with a fixed customer sequence, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times, Analysis of a linearization heuristic for single-machine scheduling to maximize profit, A best on-line algorithm for single machine scheduling with small delivery times, Machine scheduling with transportation considerations, Integrated production and delivery scheduling on a serial batch machine to minimize the makespan, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, Asymptotically optimal schedules for single-server flow shop problems with setup costs and times, Scheduling batch processing machines with incompatible job families, A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates, Machine scheduling with deliveries to multiple customer locations, Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing, Jackson's semi-preemptive scheduling on a single machine, Parallel machine scheduling with nested processing set restrictions and job delivery times, Integrated scheduling of production and distribution with release dates and capacitated deliveries, Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time, A modified shifting bottleneck procedure for job-shop scheduling, Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery, Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints, Extending the shifting bottleneck procedure to real-life applications, The job shop scheduling problem: Conventional and new solution techniques, Approximation algorithms for single machine scheduling with one unavailability period, Theoretical and practical issues in single-machine scheduling with two job release and delivery times, Heuristic methods and applications: A categorized survey, Approximation scheduling algorithms: a survey, A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan, A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\), Scheduling a single machine with primary and secondary objectives, Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Online Scheduling on Two Parallel Machines with Release Times and Delivery Times, An approximation algorithm for a single-machine scheduling problem with release times and delivery times, A note on minimizing maximum lateness in a one-machine sequencing problem with release dates, Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness, A note on generalizing the maximum lateness criterion for scheduling, Scheduling with job release dates, delivery times and preemption penalties, Online scheduling on two parallel machines with release dates and delivery times
