Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimum problem size formulation for the scheduling of plant maintenance personnel

From MaRDI portal
Publication:1166406
Jump to:navigation, search

DOI10.1007/BF00934542zbMath0488.90038OpenAlexW1976380328MaRDI QIDQ1166406

S. M. Robert, Laureano Fernando Escudero Bueno

Publication date: 1983

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934542


zbMATH Keywords

integer linear programmingmanpower planningminimum problem-size formulationscheduling plant maintenance personnel


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)


Related Items (2)

Corrective maintenance through dynamic work allocation and pre-emption: case study and application ⋮ A stochastic programming model for scheduling maintenance personnel



Cites Work

  • Scheduling of plant maintenance personnel


This page was built for publication: Minimum problem size formulation for the scheduling of plant maintenance personnel

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1166406&oldid=13237005"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki