The generalization of scheduling with machine cost

DOI10.1016/J.TCS.2013.09.009zbMATH Open1358.90044OpenAlexW2103094924MaRDI QIDQ392182FDOQ392182

Authors: Csanád Imreh, György Dósa 

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.009

Recommendations

• On-line scheduling with general machine cost functions
• General stochastic single-machine scheduling with regular cost functions
• Publication:4941834
• Online scheduling with general machine cost functions
• Single-machine scheduling with general costs under compound-type distributions
• An optimal online algorithm for scheduling with general machine cost functions
• Machine scheduling problems with a general learning effect
• A revision of machine scheduling problems with a general learning effect
• Scheduling with machine cost and rejection
• scientific article; zbMATH DE number 437570

zbMATH Keywords

online algorithmsschedulingpacking

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling with machine cost and rejection
• Lower bounds for on-line two-dimensional packing algorithms
• Shelf algorithms for on-line strip packing
• Shelf Algorithms for Two-Dimensional Packing Problems
• Better Online Algorithms for Scheduling with Machine Cost
• Title not available (Why is that?)
• A note on online strip packing
• A tight analysis of Brown-Baker-Katseff sequences for online strip packing
• Online multiple-strip packing
• Scheduling parallel jobs to minimize the makespan
• Online scheduling of parallel jobs on two machines is 2-competitive
• Online scheduling with general machine cost functions
• Preemptive online algorithms for scheduling with machine cost
• Online scheduling with machine cost and rejection
• Improved Lower Bound for Online Strip Packing
• New upper and lower bounds for online scheduling with machine cost
• Online Mixed Packing and Covering
• Online strip packing with modifiable boxes
• Improved online algorithms for parallel job scheduling and strip packing

Cited In (4)

• An optimal online algorithm for scheduling with general machine cost functions
• On-line scheduling with general machine cost functions
• Online scheduling with machine cost and a quadratic objective function
• Scheduling games on uniform machines with activation cost

This page was built for publication: The generalization of scheduling with machine cost

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