The following pages link to Daniel Oron (Q319289):
Displayed 33 items.
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Multi-location production and delivery with job selection (Q502467) (← links)
- Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172) (← links)
- Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' (Q646155) (← links)
- Scheduling problems with a weight-modifying-activity (Q828829) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- Single machine scheduling with batch-dependent setup times (Q844160) (← links)
- Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning (Q969894) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- A note on the SPT heuristic for solving scheduling problems with generalized due dates (Q1433162) (← links)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times (Q1762149) (← links)
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs (Q1887796) (← links)
- Coordinating multi-location production and customer delivery (Q1936790) (← links)
- Scheduling a batching machine with convex resource consumption functions (Q1944176) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
- Due-date assignment and maintenance activity scheduling problem (Q2426080) (← links)
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times (Q2462556) (← links)
- A single machine batch scheduling problem with bounded batch size (Q2467253) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- Minimizing flow-time on a single machine with integer batch sizes (Q2488201) (← links)
- Coupled task scheduling with convex resource consumption functions (Q2659170) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
- (Q3071146) (← links)
- Flow-shop batch scheduling with identical processing-time jobs (Q3156753) (← links)
- Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning (Q3561750) (← links)
- Due-window assignment with unit processing-time jobs (Q4651729) (← links)
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
- Two-agent single-machine scheduling with a rate-modifying activity (Q6087481) (← links)