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

DOI10.1287/OPRE.37.6.981zbMATH Open0686.90023OpenAlexW1912219820MaRDI QIDQ4205229FDOQ4205229

Authors: Richard L. Daniels, Rakesh K. Sarin 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1287/opre.37.6.981

Recommendations

• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• A multi-objective approach to resource allocation in single machine scheduling
• A survey of scheduling with controllable processing times
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Single machine scheduling with total tardiness criterion and convex controllable processing times

zbMATH Keywords

single machine schedulingnumber of tardy jobsjoint sequencing and resourc allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (36)

• Single machine common flow allowance scheduling with controllable processing times
• An experimental analysis of solution performance in a resource sharing and scheduling problem
• Scheduling two projects with controllable processing times in a single-machine environment
• Single machine scheduling with common due date and controllable processing times
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Bicriteria robotic cell scheduling
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Title not available (Why is that?)
• Parallel machine scheduling with a convex resource consumption function
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• A survey of scheduling with controllable processing times
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Minimization of the makespan in a two-machine problem under given resource constraints
• A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process
• The fixed-charge shortest-path problem
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
• Title not available (Why is that?)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
• Incorporating preference information into multi-objective scheduling
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Minimizing total tardiness on a single machine with controllable processing times
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Two parallel machine sequencing problems involving controllable job processing times
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Scheduling with controllable processing times and compression costs using population-based heuristics
• Resource cost aware scheduling

This page was built for publication: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205229)