Free Access

Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

Richard L. Daniels
Richard L. Daniels
Duke University, Durham, North Carolina
Search for more papers by this author
,
Rakesh K. Sarin
Rakesh K. Sarin
Duke University, Durham, North Carolina
Search for more papers by this author

Richard L. Daniels

Duke University, Durham, North Carolina

Search for more papers by this author

Rakesh K. Sarin

Duke University, Durham, North Carolina

Search for more papers by this author

Published Online:1 Dec 1989https://doi.org/10.1287/opre.37.6.981

Cited by
- Stochastic customer order scheduling on heterogeneous parallel machines with resource allocation consideration
  Computers & Industrial Engineering, Vol. 160
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
  15 May 2017 | International Transactions in Operational Research, Vol. 26, No. 5
- Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm
  Applied Soft Computing, Vol. 73
- Resource cost aware scheduling
  European Journal of Operational Research, Vol. 269, No. 2
- Modeling Single Machine Preemptive Scheduling to Minimize the Cost of Tardiness and Overtime
  SSRN Electronic Journal
- Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times
  21 December 2017 | Journal of the Operational Research Society, Vol. 68, No. 10
- Minimizing total weighted tardiness and overtime costs for single machine preemptive scheduling
  Computers & Industrial Engineering, Vol. 107
- Single-Machine Scheduling with Discretely Controllable Job Processing Times Subject to a Deteriorating Rate-Modifying Activity
  3 March 2016 | American Journal of Mathematical and Management Sciences, Vol. 35, No. 3
- Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
  8 September 2014 | International Transactions in Operational Research, Vol. 22, No. 6
- Preemptive Scheduling with Controllable Processing Times on Parallel Machines
  Journal of Systems Science and Information, Vol. 3, No. 1
- Controllable Processing Times in Project and Production Management: Analysing the Trade-Off between Processing Times and the Amount of Resources
  Mathematical Problems in Engineering, Vol. 2015
- Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times
  Computers & Industrial Engineering, Vol. 75
- A survey of single machine scheduling to minimize weighted number of tardy jobs
  Journal of Industrial and Management Optimization, Vol. 10, No. 1
- Unrelated Parallel-Machine Scheduling with Controllable Processing Time
  1 June 2013 | Applied Mechanics and Materials, Vol. 321-324
- The Fixed-Charge Shortest-Path Problem
  Faramroze G. Engineer,
  George L. Nemhauser,
  Martin W. P. Savelsbergh,
  Jin-Hwa Song,
  25 August 2011 | INFORMS Journal on Computing, Vol. 24, No. 4
- A hybrid nested partitions algorithm for scheduling flexible resource in flow shop problem
  14 June 2011 | International Journal of Production Research, Vol. 50, No. 10
- Parallel machine scheduling problem to minimize the makespan with resource dependent processing times
  Applied Soft Computing, Vol. 11, No. 8
- Scheduling with resource allocation and past-sequence-dependent setup times including maintenance
- Single-machine group scheduling with resource allocation and learning effect
  Computers & Industrial Engineering, Vol. 60, No. 1
- Scheduling with controllable processing times and compression costs using population-based heuristics
  20 January 2010 | International Journal of Production Research, Vol. 48, No. 23
- Minimizing total tardiness on a single machine with controllable processing times
  Computers & Operations Research, Vol. 36, No. 6
- A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine
  International Journal of Production Economics, Vol. 119, No. 2
- Bicriteria robotic cell scheduling
  23 August 2007 | Journal of Scheduling, Vol. 11, No. 6
- Single CNC machine scheduling with controllable processing times and multiple due dates
  International Journal of Production Research, Vol. 46, No. 21
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
  20 October 2007 | Journal of Scheduling, Vol. 10, No. 6
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
  12 July 2007 | Journal of Scheduling, Vol. 10, No. 4-5
- A survey of scheduling with controllable processing times
  Discrete Applied Mathematics, Vol. 155, No. 13
- The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times
  1 March 2007 | IIE Transactions, Vol. 39, No. 5
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
  European Journal of Operational Research, Vol. 177, No. 1
- Parallel machine scheduling with a convex resource consumption function
  European Journal of Operational Research, Vol. 173, No. 1
- Single machine common flow allowance scheduling with controllable processing times
  Journal of Applied Mathematics and Computing, Vol. 21, No. 1-2
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
  2 February 2006 | Naval Research Logistics (NRL), Vol. 53, No. 3
- Single machine scheduling with common due date and controllable processing times
  Applied Mathematics and Computation, Vol. 174, No. 2
- An experimental analysis of solution performance in a resource sharing and scheduling problem
  European Journal of Operational Research, Vol. 165, No. 1
- Minimizing the total weighted flow time in a single machine with controllable processing times
  Computers & Operations Research, Vol. 31, No. 13
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
  Computers & Operations Research, Vol. 31, No. 9
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
  Computers & Operations Research, Vol. 31, No. 8
- Flow Shop Scheduling with Partial Resource Flexibility
  Richard L. Daniels,
  Joseph B. Mazzola,
  Dailun Shi,
  1 May 2004 | Management Science, Vol. 50, No. 5
- Single machine scheduling with randomly compressible processing times
  15 February 2007 | Stochastic Analysis and Applications, Vol. 20, No. 3
- Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases
  Annals of Operations Research, Vol. 102, No. 1-4
- A method for scheduling in parallel manufacturing systems with flexible resources
  IIE Transactions, Vol. 32, No. 2
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times
  Stochastic Analysis and Applications, Vol. 18, No. 4
- Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell
  Computers & Industrial Engineering, Vol. 36, No. 3
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
  European Journal of Operational Research, Vol. 109, No. 1
- Minimization of the makespan in a two-machine problem under given resource constraints
  European Journal of Operational Research, Vol. 107, No. 2
- An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
  Annals of Operations Research, Vol. 70, No. 0
- A FRAMEWORK FOR MACHINE SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES
  1 December 1996 | Production and Operations Management, Vol. 5, No. 4
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
  Operations Research Letters, Vol. 19, No. 5
- Scheduling flexible manufacturing systems for apparel production
  IEEE Transactions on Robotics and Automation, Vol. 12, No. 5
- Due-date assignment and single machine scheduling with compressible processing times
  International Journal of Production Economics, Vol. 43, No. 2-3
- Due-date assignment and single machine scheduling with compressible processing times
  International Journal of Production Economics, Vol. 43, No. 1
- Parallel-machine scheduling with controllable processing times
  31 May 2007 | IIE Transactions, Vol. 28, No. 2
- A survey on the resource-constrained project scheduling problem
  13 July 2010 | IIE Transactions, Vol. 27, No. 5
- Incorporating preference information into multi-objective scheduling
  European Journal of Operational Research, Vol. 77, No. 2
- A bicriterion objective for levelling the schedule of a mixed-model, JIT assembly process
  Mathematical and Computer Modelling, Vol. 20, No. 2
- Two parallel machine sequencing problems involving controllable job processing times
  European Journal of Operational Research, Vol. 70, No. 3
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
  Annals of Operations Research, Vol. 41, No. 3
- Single machine scheduling with controllable processing times: a parametric study
  International Journal of Production Economics, Vol. 22, No. 2
- Multiobjective flow-shop scheduling
  Naval Research Logistics, Vol. 37, No. 6
- Single Machine Common Due Window Scheduling with Controllable Job Processing Times

Volume 37, Issue 6

November-December 1989

Pages 853-992

Article Information

Metrics

Information

Published Online:December 01, 1989

Cite as

Richard L. Daniels, Rakesh K. Sarin, (1989) Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy. Operations Research 37(6):981-984.

https://doi.org/10.1287/opre.37.6.981

Keywords

production/scheduling: deterministic sequencing, single machine

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

Volume 37, Issue 6

Article Information

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News