Pages that link to "Item:Q4632940"
From MaRDI portal
The following pages link to <i>CON</i>/<i>SLK</i> due date assignment and scheduling on a single machine with two agents (Q4632940):
Displaying 26 items.
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights (Q2047217) (← links)
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads (Q2075458) (← links)
- A unified analysis for scheduling problems with variable processing times (Q2076372) (← links)
- Due date assignment and two-agent scheduling under multitasking environment (Q2084604) (← links)
- Due-window assignment scheduling with learning and deterioration effects (Q2086934) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
- Minmax due-date assignment on a two-machine flowshop (Q2241579) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents (Q3120079) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
- Proportionate flowshop scheduling with position-dependent weights (Q5059283) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
- Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights (Q5149554) (← links)
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs (Q6046632) (← links)
- Two‐agent scheduling with linear resource‐dependent processing times (Q6072167) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
