Pages that link to "Item:Q454994"

The following pages link to Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994):

Displaying 32 items.

• A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
• A scheduling problem with three competing agents (Q337134) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
• Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities (Q497936) (← links)
• Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine (Q506457) (← links)
• Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times (Q513627) (← links)
• Single machine group scheduling with time dependent processing times and ready times (Q726558) (← links)
• Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
• A branch and bound algorithm for project scheduling problem with spatial resource constraints (Q1666182) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
• Two-agent scheduling to minimize the maximum cost with position-dependent jobs (Q1723571) (← links)
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time (Q1730624) (← links)
• Single-machine group scheduling problems with deterioration to minimize the sum of completion times (Q1954598) (← links)
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• Single-machine multitasking scheduling with job efficiency promotion (Q2168741) (← links)
• A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
• Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
• Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
• A Batch Scheduling Problem with Two Agents (Q2788524) (← links)
• One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations (Q5252922) (← links)
• Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
• Single Machine Two-Agent Scheduling with Deteriorating Jobs (Q5506754) (← links)
• An Ordered Flow Shop with Two Agents (Q5506757) (← links)