ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA

DOI10.15807/jorsj.24.37zbMath0453.90045OpenAlexW2725019584MaRDI QIDQ3901283

Shigeji Miyazaki

Publication date: 1981

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.24.37

zbMATH Keywords

algorithmdual criteriaone machine scheduling problemminimization of mean weighted flow-timepairwise local optimal schedule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Single machine scheduling to minimize weighted earliness subject to no tardy jobs ⋮ Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. ⋮ An algorithm for single machine sequencing with deadlines to minimize total weighted completion time ⋮ Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming ⋮ Multicriteria scheduling problems: a survey ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem

This page was built for publication: ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA