Pages that link to "Item:Q2768989"

The following pages link to Scheduling with deadlines and loss functions (Q2768989):

Displaying 50 items.

• Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
• Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems (Q298048) (← links)
• Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
• On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost (Q319441) (← links)
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• Parallel machine scheduling problem with preemptive jobs and transportation delay (Q337061) (← links)
• ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times (Q337126) (← links)
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211) (← links)
• A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
• Semantic-aware optimization of user interface menus (Q462068) (← links)
• Parallel machine covering with limited number of preemptions (Q462268) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
• Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
• Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
• A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
• Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems (Q645817) (← links)
• T-L plane-based real-time scheduling for homogeneous multiprocessors (Q666041) (← links)
• Complexity and approximation of an area packing problem (Q691403) (← links)
• Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
• Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
• Linear programming models for load balancing (Q810365) (← links)
• Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• Models and complexity of multibin packing problems (Q864931) (← links)
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
• Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
• Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
• On a parallel machine scheduling problem with precedence constraints (Q880562) (← links)
• Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
• Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule (Q908838) (← links)
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
• Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
• Approximation schemes for packing with item fragmentation (Q927410) (← links)
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)