Schedules with precedence restriction and position-dependent servicing durability - Mines Saint-Étienne
Journal Articles Doklady of the national academy of sciences of Belarus Year : 2010

Schedules with precedence restriction and position-dependent servicing durability

Valery Gordon
  • Function : Author
Alexandre Dolgui
Centre de Génie Industriel et Informatique
CV
Vitaly Strusevich
  • Function : Author
  • PersonId : 841774
University of Greenwich

Abstract

We demonstrate that several single machine scheduling problems with positionally dependent processing times can be solved in polynomial time, provided that the graph that defines precedence constraints admit modular decomposition into factors of a bounded width.

Domains

Modeling and Simulation

Florent Breuil  : Connect in order to contact the contributor

https://hal-emse.ccsd.cnrs.fr/emse-00676028

Submitted on : Friday, March 2, 2012-4:35:05 PM

Last modification on : Tuesday, September 17, 2024-3:45:43 PM

No file

Dates and versions

emse-00676028 , version 1 (02-03-2012)

Identifiers

  • HAL Id : emse-00676028 , version 1

Cite

Valery Gordon, Alexandre Dolgui, Vitaly Strusevich. Schedules with precedence restriction and position-dependent servicing durability. Doklady of the national academy of sciences of Belarus, 2010, vol. 54 (n°4), p. 47-52. ⟨emse-00676028⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EMSE G2I-ENSMSE MSGI-ENSMSE UR-LSTI-ENSMSE ROGI-ENSMSE FAYOL-ENSMSE DEMO-ENSMSE TDS-MACS INSTITUT-MINES-TELECOM
68 View
0 Download

Share

More