The following pages link to Michael L. Pinedo (Q408367):
Displayed 50 items.
- Item:Q408367 (redirect page) (← links)
- Personnel scheduling and supplies provisioning in emergency relief operations (Q256662) (← links)
- Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
- Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms (Q319704) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Open shops with jobs overlap -- revisited (Q706904) (← links)
- Scheduling stochastic jobs with due dates on parallel machines (Q750283) (← links)
- A note on the flow time and the number of tardy jobs in stochastic open shops (Q796445) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Bounds and inequalities for single server loss systems (Q915290) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
- Complexity of a scheduling problem with controllable processing times (Q969518) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- A decomposition scheme for single stage scheduling problems (Q983632) (← links)
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
- Minimizing total weighted completion time in a proportionate flow shop (Q1268838) (← links)
- Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
- Current trends in deterministic scheduling (Q1374418) (← links)
- On the design and development of object-oriented scheduling systems (Q1374447) (← links)
- Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
- Two dimensional load balancing (Q1785303) (← links)
- Networks of queues with batch services, signals and product form solutions (Q1924617) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- A note on makespan minimization in proportionate flow shops (Q1944041) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing (Q2076926) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
- Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- Journal of scheduling (2020) (Q2305015) (← links)
- In memoriam: Dr. Joseph Leung (Q2317135) (← links)
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)