Optimal composition ordering problems for piecewise linear functions

DOI10.1007/s00453-017-0397-yzbMath1392.68204OpenAlexW2963694050MaRDI QIDQ724224

Yasushi Kawase, Kento Seimi, Kazuhisa Makino

Publication date: 25 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6812/

zbMATH Keywords

ordering problemfunction compositiontime-dependent scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Scheduling jobs with a V-shaped time-dependent processing time ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Scheduling jobs with varying processing times
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Time-dependent scheduling
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• On a scheduling problem of time deteriorating jobs
• Who solved the secretary problem
• Complexity of scheduling tasks with time-dependent execution times
• A concise survey of scheduling with time-dependent processing times
• On variants of the matroid secretary problem
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• A Knapsack Secretary Problem with Applications
• Parametric problem in scheduling theory
• Scheduling jobs with piecewise linear decreasing processing times

This page was built for publication: Optimal composition ordering problems for piecewise linear functions