A new project scheduling problem with worker-dependent durations

DOI10.1142/S0217595925500022MaRDI QIDQ6900754zbMATH OpenFDO

Authors Byung-Cheon Choi, Jibok Chung

Publication date 12 November 2025

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595925500022

zbMATH Keywords

completely ordered activitiescomputational complexityproject scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Cites work

• A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Assignment Problems
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Concurrent Crashing and Overlapping in Product Development
• scientific article; zbMATH DE number 3748788 (Why is no real title available?)
• scientific article; zbMATH DE number 193993 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

This page was built for publication: A new project scheduling problem with worker-dependent durations

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