Parallel machines scheduling with nonsimultaneous machine available time
From MaRDI portal
Publication:757232
DOI10.1016/0166-218X(91)90013-MzbMath0722.90032OpenAlexW2077711297MaRDI QIDQ757232
Publication date: 1991
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(91)90013-m
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (60)
Parallel machine scheduling under a grade of service provision ⋮ Unnamed Item ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ Scheduling with incompatible jobs ⋮ Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Machine scheduling performance with maintenance and failure ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint ⋮ A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME ⋮ Streaming algorithms for multitasking scheduling with shared processing ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ Parallel-machine scheduling with non-simultaneous machine available time ⋮ Three-partitioning containing kernels: Complexity and heuristic ⋮ The exact bound of Lee's MLPT ⋮ An on-line scheduling problem of parallel machines with common maintenance time ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Scheduling on same-speed processors with at most one downtime on each machine ⋮ Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines ⋮ Approximation for scheduling on uniform nonsimultaneous parallel machines ⋮ Exact performance of MULTIFIT for nonsimultaneous machines ⋮ A note on parallel machine scheduling with non-simultaneous machine available time ⋮ Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem ⋮ Scheduling with limited machine availability ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Unnamed Item ⋮ Scheduling on uniform processors with at most one downtime on each machine ⋮ Scheduling identical parallel machines with tooling constraints ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ The effect of machine availability on the worst-case performance of LPT ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Scheduling two-stage hybrid flow shop with availability constraints ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ Parallel machine scheduling with multiple unloading servers ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Two-machine flow shops with limited machine availability ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Optimal online algorithms for scheduling on two identical machines under a grade of service ⋮ Approximation algorithms for scheduling with reservations ⋮ Parallel machines scheduling with machine shutdowns ⋮ Makespan minimization for parallel machines scheduling with multiple availability constraints ⋮ The multifit algorithm for set partitioning containing kernels ⋮ Minimizing the sum of job completion times on capacitated two-parallel machines ⋮ A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system ⋮ A general lower bound for the makespan problem ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times ⋮ MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS ⋮ Uniform machine scheduling with machine available constraints ⋮ Scheduling interfering job sets on parallel machines ⋮ Machine scheduling with an availability constraint ⋮ Two-machine flowshop scheduling with availability constraints ⋮ A new tabu search procedure for an audit-scheduling problem ⋮ The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines ⋮ Machine scheduling with a rate-modifying activity ⋮ Optimal online algorithm for scheduling on two identical machines with machine availability constraints. ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times ⋮ Single-machine scheduling with periodic maintenance and nonresumable jobs.
Cites Work
- Unnamed Item
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Evaluation of a MULTIFIT-based scheduling algorithm
- The Asymptotic Optimality of the LPT Rule
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Parallel machines scheduling with nonsimultaneous machine available time
