Scheduling jobs and maintenance activities on parallel machines (Q2359536)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Scheduling jobs and maintenance activities on parallel machines	scientific article

Statements

scholarly article

0 references

Scheduling jobs and maintenance activities on parallel machines (English)

0 references

zbMATH Open document ID

0 references

10.1007/s12351-012-0130-1

0 references

0 references

0 references

Kondo Hloindo Adjallah

0 references

Operational Research. An International Journal

0 references

publication date

29 June 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

maintenance

0 references

scheduling

0 references

lower bound

0 references

heuristic

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s12351-012-0130-1

0 references

0 references

An integrated production and preventive maintenance planning model

0 references

0 references

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval

0 references

Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period

0 references

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

0 references

Approximation algorithms for single machine scheduling with one unavailability period

0 references

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

0 references

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

0 references

Two-machine flow shops with limited machine availability

0 references

Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

0 references

Scheduling jobs and maintenance activities on parallel machines

0 references

Single machine earliness and tardiness scheduling

0 references

Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times

0 references

A Branch and Bound Algorithm for the Total Weighted Tardiness Problem

0 references

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

0 references

Scheduling with limited machine availability

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2359536

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2359536&oldid=36330494"