An efficient time algorithm for makespan objectives

DOI10.11121/IJOCTA.01.2015.00260MaRDI QIDQ2809897zbMATH OpenOpenAlexFDO

Authors Yücel Öztürkoğlu

Publication date 30 May 2016

Published in An International Journal of Optimization and Control: Theories \& Applications (IJOCTA) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.11121/ijocta.01.2015.00260

zbMATH Keywords

schedulingsingle machinemakespandeteriorating jobsrate-modifying-activity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Problems of single-machine scheduling with rate-modifying activities under deterioration
• Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration
• Single machine problem with multi-rate-modifying activities under a time-dependent deterioration
• scientific article; zbMATH DE number 6531643
• On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs

Cited in

(5)

• scientific article; zbMATH DE number 1226309 (Why is no real title available?)
• Problems of single-machine scheduling with rate-modifying activities under deterioration
• An exact algorithm for the bi-objective timing problem
• Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration
• An Algebraic Approach to Time-Span Reduction

This page was built for publication: An efficient time algorithm for makespan objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809897)