Single machine scheduling with flow time and earliness penalties
From MaRDI portal
Publication:686991
DOI10.1007/BF01096772zbMath0801.90058MaRDI QIDQ686991
Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard
Publication date: 13 October 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
schedulingdue datesingle machinebicriteria optimizationbranch-and- boundflow time and earliness penaltiesgreedy heuristics
Related Items (3)
Minimizing the sum of weighted completion times with unrestricted weights ⋮ Metaheuristics: A bibliography ⋮ Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- 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
- Applying new dominance concepts to job schedule optimization
- 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
- Batching to Minimize Flow Times on One Machine
- A Dynamic Programming Approach to Sequencing Problems
- Minimizing the average deviation of job completion times about a common due date
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Minimizing Weighted Completion Times with Deadlines
- 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
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Branch-and-Bound Strategies for Dynamic Programming
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
This page was built for publication: Single machine scheduling with flow time and earliness penalties