Scheduling two projects with controllable processing times in a single-machine environment
From MaRDI portal
Publication:2215194
DOI10.1007/s10951-020-00658-3zbMath1456.90069OpenAlexW3036795801MaRDI QIDQ2215194
Byung-Cheon Choi, Myoung-Ju Park
Publication date: 11 December 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00658-3
Related Items (3)
Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents
Cites Work
- Unnamed Item
- 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
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
- Scheduling two agents with controllable processing times
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Minimizing total tardiness on a single machine with controllable processing times
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A survey of scheduling with controllable processing times
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- A multiple-criterion model for machine scheduling
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A Network Flow Computation for Project Cost Curves
- Competitive Two-Agent Scheduling and Its Applications
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Critical-Path Planning and Scheduling: Mathematical Basis
- Scheduling Problems with Two Competing Agents
- Rescheduling for New Orders
- Approximation Schemes for the Restricted Shortest Path Problem
- Scheduling to minimize the total compression and late costs
- Single machine just‐in‐time scheduling problems with two competing agents
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Concurrent Crashing and Overlapping in Product Development
- Multiagent Scheduling
- Critical Path Problems with Concave Cost-Time Curves
This page was built for publication: Scheduling two projects with controllable processing times in a single-machine environment
