Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis

DOI10.1016/0167-6377(91)90071-VzbMath0744.90045MaRDI QIDQ1186948

Stanisław Zdrzałka

Publication date: 28 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsingle machineworst-case performancerelease dateoverall schedule cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Scheduling with controllable processing times and compression costs using population-based heuristics, A survey of scheduling with controllable processing times, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Scheduling with tool changes to minimize total completion time under controllable machining conditions, Single machine scheduling with discretely controllable processing times, A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates, Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, Single machine scheduling with total tardiness criterion and convex controllable processing times, Single machine scheduling with common due date and controllable processing times, Single machine scheduling with resource dependent release times and processing times, A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates, Single machine common flow allowance scheduling with controllable processing times, A new bounding mechanism for the CNC machine scheduling problems with controllable processing times, Single–machine scheduling with random machine breakdowns and randomly compressible processing times, Two parallel machine sequencing problems involving controllable job processing times, An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• A block approach for single-machine scheduling with release dates and due dates
• A two-machine flow shop scheduling problem with controllable job processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• The one-machine sequencing problem
• Job-shop scheduling with resource-time models of operations
• A Generalized Uniform Processor System
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• The Theory of Networks and Management Science. Part I