Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints

DOI10.1016/J.COR.2005.09.002MaRDI QIDQ868990zbMATH OpenOpenAlexFDO

Authors Gwo-Ji Sheen, Lu-Wen Liao

Publication date 26 February 2007

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.09.002

zbMATH Keywords

availability constraintbinary searcheligibility constraintlatenessmachines with identical speednetwork flowsscheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
• Scheduling on parallel identical machines to minimize total tardiness
• Scheduling on uniform parallel machines to minimize maximum lateness
• Machine scheduling with an availability constraint and job delivery coordination
• Parallel-machine scheduling with time-dependent and machine availability constraints
• Optimal parallel machines scheduling with availability constraints
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• Machine scheduling with availability constraints

Cites work

• A note on parallel machine scheduling with non-simultaneous machine available time
• Current trends in deterministic scheduling
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3784259 (Why is no real title available?)
• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• Machine scheduling with an availability constraint
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• Network flows. Theory, algorithms, and applications.
• NP-complete scheduling problems
• Parallel machine scheduling of machine-dependent jobs with unit-length.
• Parallel machine scheduling under a grade of service provision
• Parallel machines scheduling with machine shutdowns
• Parallel machines scheduling with nonsimultaneous machine available time
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Scheduling preemptable tasks on parallel processors with limited availability
• Scheduling with deadlines and loss functions
• Scheduling with limited machine availability

Cited in

(7)

• Exponential inapproximability and FPTAS for scheduling with availability constraints
• The battery switching station scheduling problem
• A branch and bound algorithm for optimal television commercial scheduling
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Parallel machine scheduling with machine availability and eligibility constraints
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
• Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints

This page was built for publication: Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints

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