Parallel machines scheduling with nonsimultaneous machine available time

Cites Work

Title not available (Why is that?)
Bounds for Certain Multiprocessing Anomalies
Bounds on Multiprocessing Timing Anomalies
An Application of Bin-Packing to Multiprocessor Scheduling
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

Cited In (65)

An on-line scheduling problem of parallel machines with common maintenance time
Machine scheduling with an availability constraint
Parallel machine scheduling with machine availability and eligibility constraints
Scheduling two-stage hybrid flow shop with availability constraints
Title not available (Why is that?)
Approximation for scheduling on uniform nonsimultaneous parallel machines
Exact performance of MULTIFIT for nonsimultaneous machines
Makespan minimization for parallel machines scheduling with multiple availability constraints
Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Scheduling jobs with maintenance subject to load-dependent duration on a single machine
Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
Scheduling with incompatible jobs
Uniform machine scheduling with machine available constraints
Scheduling on same-speed processors with at most one downtime on each machine
Optimal online algorithms for scheduling on two identical machines under a grade of service
Approximation algorithms for scheduling with reservations
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
Parallel machine scheduling under a grade of service provision
The effect of machine availability on the worst-case performance of LPT
Minimizing the sum of job completion times on capacitated two-parallel machines
Parallel machines scheduling with machine shutdowns
MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
The exact bound of Lee's MLPT
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
Optimal parallel machines scheduling with availability constraints
Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
A note on parallel machine scheduling with non-simultaneous machine available time
Scheduling identical parallel machines with tooling constraints
Title not available (Why is that?)
Scheduling with deteriorating jobs and non-simultaneous machine available times
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
Optimal scheduling of a two-stage hybrid flow shop
A semi-on-line scheduling problem of two parallel machines with common maintenance time
Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
A new tabu search procedure for an audit-scheduling problem
Parallel machine scheduling with multiple unloading servers
Single-machine scheduling with periodic maintenance and nonresumable jobs.
Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
Makespan minimization for two parallel machines with an availability constraint
Scheduling interfering job sets on parallel machines
Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
Two-machine flow shops with limited machine availability
Single-machine scheduling with maintenance and repair rate-modifying activities
Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Two-machine flowshop scheduling with availability constraints
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
The multifit algorithm for set partitioning containing kernels
Three-partitioning containing kernels: Complexity and heuristic
Parallel-machine scheduling with non-simultaneous machine available time
Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
Machine scheduling with a rate-modifying activity
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Scheduling on uniform processors with at most one downtime on each machine
Title not available (Why is that?)
A general lower bound for the makespan problem
Machine scheduling performance with maintenance and failure
Streaming algorithms for multitasking scheduling with shared processing
A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system
The LPT heuristic for minimizing total load on a proportionate openshop
Multitasking scheduling with shared processing
Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines

This page was built for publication: Parallel machines scheduling with nonsimultaneous machine available time

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