Parallel machines scheduling with nonsimultaneous machine available time

Recommendations

scientific article; zbMATH DE number 1150234
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
Parallel scheduling problem with non-simultaneous machine available times

Cites work

scientific article; zbMATH DE number 3639144 (Why is no real title available?)
An Application of Bin-Packing to Multiprocessor Scheduling
Bounds for Certain Multiprocessing Anomalies
Bounds on Multiprocessing Timing Anomalies
Evaluation of a MULTIFIT-based scheduling algorithm
Multiprocessor scheduling: Combining LPT and MULTIFIT
The Asymptotic Optimality of the LPT Rule
Tighter Bounds for the Multifit Processor Scheduling Algorithm

Cited in

(79)

Scheduling with deteriorating jobs and non-simultaneous machine available times
Uniform machine scheduling with machine available constraints
Scheduling jobs with maintenance subject to load-dependent duration on a single machine
Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
Approximation algorithms for scheduling with reservations
Exact performance of MULTIFIT for nonsimultaneous machines
Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
Makespan minimization for parallel machines scheduling with multiple availability constraints
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
An on-line scheduling problem of parallel machines with common maintenance time
Two-machine flow shops with limited machine availability
Single-machine scheduling with maintenance and repair rate-modifying activities
Scheduling identical parallel machines with tooling constraints
The effect of machine availability on the worst-case performance of LPT
Scheduling two-stage hybrid flow shop with availability constraints
Scheduling on same-speed processors with at most one downtime on each machine
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
Optimal parallel machines scheduling with availability constraints
A new tabu search procedure for an audit-scheduling problem
scientific article; zbMATH DE number 1559404 (Why is no real title available?)
Parallel machine scheduling with machine availability and eligibility constraints
Minimizing the sum of job completion times on capacitated two-parallel machines
Two-machine flowshop scheduling with availability constraints
Scheduling on uniform processors with at most one downtime on each machine
The longest processing time rule for identical parallel machines revisited
scientific article; zbMATH DE number 6453531 (Why is no real title available?)
Makespan minimization for two parallel machines with an availability constraint
MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
Parallel machine scheduling under a grade of service provision
Heuristic algorithms for a complex parallel machine scheduling problem
Parallel scheduling problem with non-simultaneous machine available times
Parallel machines scheduling with machine shutdowns
Approximation for scheduling on uniform nonsimultaneous parallel machines
Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
scientific article; zbMATH DE number 4043236 (Why is no real title available?)
Scheduling with limited machine availability
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
Parallel machine scheduling with multiple unloading servers
The exact bound of Lee's MLPT
Linear time algorithms for parallel machine scheduling
Optimal scheduling of a two-stage hybrid flow shop
Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
Scheduling with incompatible jobs
Comparing the minimum completion times of two longest-first scheduling-heuristics
Scheduling interfering job sets on parallel machines
Machine scheduling with an availability constraint
A general lower bound for the makespan problem
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Parallel-machine scheduling with non-simultaneous machine available time
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Minimizing makespan on parallel machines with release time and machine eligibility restrictions
Optimal online algorithms for scheduling on two identical machines under a grade of service
Single-machine scheduling with periodic maintenance and nonresumable jobs.
A semi-on-line scheduling problem of two parallel machines with common maintenance time
scientific article; zbMATH DE number 2219502 (Why is no real title available?)
Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
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
scientific article; zbMATH DE number 4164535 (Why is no real title available?)
Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
scientific article; zbMATH DE number 1389747 (Why is no real title available?)
A note on the optimal makespan of a parallel machine scheduling problem
Machine scheduling with a rate-modifying activity
The worst-case ratio of algorithm \(A_{KK}\) for parallel machines scheduling with non-simultaneous machine available times
Algorithmic Applications in Management
A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system
Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines
Multitasking scheduling with shared processing
Three-partitioning containing kernels: Complexity and heuristic
Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
The LPT heuristic for minimizing total load on a proportionate openshop
Machine scheduling performance with maintenance and failure
The multifit algorithm for set partitioning containing kernels
scientific article; zbMATH DE number 34575 (Why is no real title available?)
Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
Streaming algorithms for multitasking scheduling with shared processing

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)