Optimal selection and scheduling of jobs with uncertain durations for two employees

MaRDI QIDQ6641475

N. M. Matsveichuk, Yuriĭ Nazarovich Sotskov

Publication date: 20 November 2024

Published in: Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika (Search for Journal in Brave)

zbMATH Keywords

optimal scheduleuncertain processing timestime-management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
• TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Pareto, Zipf and other power laws

This page was built for publication: Optimal selection and scheduling of jobs with uncertain durations for two employees

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