Pages that link to "Item:Q2434248"

The following pages link to Parallel machine problems with equal processing times: a survey (Q2434248):

Displaying 27 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) (← links)
• A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
• Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
• Due-window assignment problems with unit-time jobs (Q902534) (← links)
• Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
• Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
• Two parallel-machine scheduling problems with function constraint (Q2187975) (← links)
• An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines (Q2242193) (← links)
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
• Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
• Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
• Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
• The ``least flexible job first'' rule in scheduling and in queueing (Q2450742) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
• Faster algorithms for bicriteria scheduling of identical jobs on uniform machines (Q2691455) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
• Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)