PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
Publication:3863414
DOI10.15807/jorsj.22.205zbMath0427.90049MaRDI QIDQ3863414
Toshihide Ibaraki, Hisashi Mine, Hiroshi Kise
Publication date: 1979
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.22.205
performance analysis; numerical study; ready times; randomly generated problems; worst case performance; minimization of maximum lateness; due times; one- machine scheduling; six approximation algorithms
65K05: Numerical mathematical programming methods
65K10: Numerical optimization and variational techniques
90B35: Deterministic scheduling theory in operations research
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items