Single-machine scheduling of multiple projects with controllable processing times

DOI10.1016/j.ejor.2023.01.026MaRDI QIDQ6167669

Zhichao Geng, Jinjiang Yuan

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingcontrollable processing timespseudo-polynomial algorithmmultiple projectscompression cost

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost
• Complexity results for scheduling chains on a single machine
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Nash equilibrium solutions in multi-agent project scheduling with milestones
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Scheduling two projects with controllable processing times in a single-machine environment
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• A survey of scheduling with controllable processing times
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Integrated multi-project planning and scheduling -- a multiagent approach
• Competitive Two-Agent Scheduling and Its Applications
• Critical-Path Planning and Scheduling: Mathematical Basis
• Scheduling Problems with Two Competing Agents
• Approximation Schemes for the Restricted Shortest Path Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Scheduling to minimize the total compression and late costs
• Multiagent Scheduling
• Critical Path Problems with Concave Cost-Time Curves

This page was built for publication: Single-machine scheduling of multiple projects with controllable processing times