Single machine scheduling with flow time and earliness penalties
type: Item
instance of: scholarly article
title: Single machine scheduling with flow time and earliness penalties
zbMATH Open document ID: 0801.90058
DOI: 10.1007/BF01096772
author: Jonathan F. Bard
author: Krishnamurthi Venkatraman
author: Thomas A. Feo
published in: Journal of Global Optimization
publication date: 1993-10-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 429056
zbMATH Keywords: single machine
zbMATH Keywords: greedy heuristics
zbMATH Keywords: bicriteria optimization
zbMATH Keywords: branch-and- bound
zbMATH Keywords: scheduling
zbMATH Keywords: flow time and earliness penalties
zbMATH Keywords: due date
MaRDI profile type: Publication
cites work: Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
cites work: Note—Operations Sequencing in Discrete Parts Manufacturing
cites work: Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
cites work: A Dynamic Programming Approach to a Lot Size Scheduling Problem
cites work: Q5181520
cites work: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
cites work: Batching to Minimize Flow Times on One Machine
cites work: The art and theory of dynamic programming
cites work: Applying new dominance concepts to job schedule optimization
cites work: A GRASP for a difficult single machine scheduling problem
cites work: A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
cites work: Q4198056
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Optimization by Simulated Annealing
cites work: Branch-and-Bound Strategies for Dynamic Programming
cites work: Minimizing Weighted Completion Times with Deadlines
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
description: scientific article; zbMATH DE number 429056