Job sequencing with uncertain and controllable processing times

DOI10.1111/J.1475-3995.1999.TB00169.XMaRDI QIDQ6852463zbMATH OpenFDO

Authors G. I. Adamopoulos, Costas P. Pappis, Nikos Karacapilidis

Publication date 25 February 2026

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/J.1475-3995.1999.TB00169.X

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cited in

(1)

• An allocation rule for connection scheduling problems

This page was built for publication: Job sequencing with uncertain and controllable processing times

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