Single-machine scheduling of multiple projects with controllable processing times

DOI10.1016/J.EJOR.2023.01.026MaRDI QIDQ6167669zbMATH OpenFDO

Authors Zhichao Geng, Jinjiang Yuan

Publication date 10 July 2023

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.01.026

zbMATH Keywords

compression costcontrollable processing timesmultiple projectspseudo-polynomial algorithmscheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

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

Cited in

(4)

• Scheduling two projects with controllable processing times in a single-machine environment
• Optimal Strategies for Multiclass Job Scheduling on a Single Machine With Controllable Processing Times
• Just-in-time scheduling problem with affine idleness cost
• Scheduling with assignable due dates, two competing agents and late work related criteria

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

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