The following pages link to Jeffrey B. Sidney (Q853748):
Displaying 37 items.
- A note on productivity gains in flexible robotic cells (Q853749) (← links)
- (Q976012) (redirect page) (← links)
- The Browne-Yechiali single-machine sequence is optimal for flow-shops (Q976013) (← links)
- Interpolation-binary search (Q1062762) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- (Q1112073) (redirect page) (← links)
- Circle orders, n-gon orders and the crossing number (Q1112075) (← links)
- Optimal flow-shop scheduling with earliness and tardiness penalties (Q1159565) (← links)
- A distributed selection algorithm and its expected communication complexity (Q1193632) (← links)
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups (Q1577472) (← links)
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← links)
- Ordinal algorithms for packing with target center of gravity (Q1815847) (← links)
- Scheduling with general job-dependent learning curves. (Q1873012) (← links)
- Ordinal algorithms for parallel machine scheduling (Q1919194) (← links)
- Bin packing using semi-ordinal data (Q2564622) (← links)
- Distributed Sorting (Q3219775) (← links)
- (Q3341890) (← links)
- Scheduling a deteriorating maintenance activity on a single machine (Q3585714) (← links)
- (Q3683099) (← links)
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms (Q3750504) (← links)
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions (Q3760291) (← links)
- Shout echo selection in distributed files (Q3782753) (← links)
- (Q3787482) (← links)
- (Q3794820) (← links)
- Geometric Containment and Partial Orders (Q3824456) (← links)
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (Q3863680) (← links)
- Sequencing with Series-Parallel Precedence Constraints (Q3879034) (← links)
- (Q3945584) (← links)
- A Decomposition Algorithm for Sequencing with General Precedence Constraints (Q3962769) (← links)
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs (Q4060706) (← links)
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties (Q4162942) (← links)
- (Q4239706) (← links)
- Batching and Scheduling in FMS Hubs: Flow Time Considerations (Q4285166) (← links)
- Scheduling in broadcast networks (Q4540079) (← links)
- Note on scheduling with general learning curves to minimize the number of tardy jobs (Q4671554) (← links)
- (Q5181074) (← links)
- A Comment on a Paper of Maxwell (Q5653798) (← links)
