Single machine scheduling with flow time and earliness penalties

DOI10.1007/BF01096772MaRDI QIDQ686991zbMATHFDO

Authors Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo

Publication date 13 October 1993

Published in Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

schedulingsingle machinedue datebicriteria optimizationbranch-and- boundflow time and earliness penaltiesgreedy heuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• scientific article; zbMATH DE number 1054964
• Single machine scheduling with symmetric earliness and tardiness penalties

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3428742 (Why is no real title available?)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• A GRASP for a difficult single machine scheduling problem
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Applying new dominance concepts to job schedule optimization
• Batching to Minimize Flow Times on One Machine
• Branch-and-Bound Strategies for Dynamic Programming
• Minimizing Weighted Completion Times with Deadlines
• Minimizing the average deviation of job completion times about a common due date
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• Note—Operations Sequencing in Discrete Parts Manufacturing
• Optimization by simulated annealing
• Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
• The art and theory of dynamic programming

Cited in

(5)

• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• Metaheuristics: A bibliography
• Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
• Single machine scheduling with symmetric earliness and tardiness penalties
• Minimizing the sum of weighted completion times with unrestricted weights

This page was built for publication: Single machine scheduling with flow time and earliness penalties

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