Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines

DOI10.1016/j.tcs.2015.12.020zbMath1334.90053OpenAlexW2221870502MaRDI QIDQ906399

Jiayin Tan, Dakui Jiang

Publication date: 21 January 2016

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

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

zbMATH Keywords

schedulingheuristicunrelated machinesrejectionmachine availability constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Parallel machine scheduling with restricted job rejection ⋮ Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints

Cites Work

• A survey on offline scheduling with rejection
• Parallel machines scheduling with nonsimultaneous machine available time
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
• Preemptive scheduling with rejection
• A note on parallel machine scheduling with non-simultaneous machine available time
• Order Assignment and Scheduling in a Supply Chain
• Multiprocessor Scheduling with Rejection

This page was built for publication: Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines