Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money
From MaRDI portal
Publication:5865924
DOI10.1142/S021759592150024XzbMath1490.90140OpenAlexW3160328748MaRDI QIDQ5865924
Feifeng Zheng, Rongteng Zhi, Ming Liu, Yin-Feng Xu
Publication date: 10 June 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021759592150024x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Single-machine scheduling with positional due indices and positional deadlines
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
- Revenue sharing contracts for horizontal capacity sharing under competition
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- Scheduling Markovian PERT networks to maximize the net present value: new results
- A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
- Single‐machine scheduling with deadlines to minimize the total weighted late work
This page was built for publication: Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money