Single machine scheduling with flow time and earliness penalties

DOI10.1007/BF01096772zbMATH Open0801.90058MaRDI QIDQ686991FDOQ686991

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)

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

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)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• A Dynamic Programming Approach to Sequencing Problems
• Batching to Minimize Flow Times on One Machine
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• A GRASP for a difficult single machine scheduling problem
• The art and theory of dynamic programming
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Minimizing Weighted Completion Times with Deadlines
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• Title not available (Why is that?)
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Branch-and-Bound Strategies for Dynamic Programming
• Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
• Minimizing the average deviation of job completion times about a common due date
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
• Applying new dominance concepts to job schedule optimization
• 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

Cited In (5)

• Minimizing the sum of weighted completion times with unrestricted weights
• Single machine scheduling with symmetric earliness and tardiness penalties
• 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

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)