Sequencing heuristic for bicriteria scheduling in a single machine problem

DOI10.1080/02522667.2006.10699702zbMath1192.90068OpenAlexW1968505916MaRDI QIDQ3411893

Wen-Jinn Chen, Sumei Lin, Jia-Chi Tsou

Publication date: 30 November 2006

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: http://www.tarupublications.com/journals/jios/jios2722006.html

zbMATH Keywords

schedulingmaximum tardinesscompletion timesefficient schedule

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Bounds for the position of the smallest job in completion time variance minimization
• Completion time variance minimization on a single machine is difficult
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing Variation of Flow Time in Single Machine Systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Minimising Waiting Time Variance in the Single Machine Problem
• Variance Minimization in Single Machine Sequencing Problems
• Sequencing with setup time and order tardiness trade-offs