The following pages link to Djamal Rebaine (Q1013297):
Displaying 26 items.
- (Q833546) (redirect page) (← links)
- Scheduling identical parallel machines and operators within a period based changing mode (Q833547) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) (← links)
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan (Q1667166) (← links)
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode (Q1752167) (← links)
- A polynomial time algorithm for unloading boxes off a gravity conveyor (Q1799383) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
- Linear time algorithms on mirror trees (Q2091108) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
- Analysis of heuristics for the UET two-machine flow shop problem with time delays (Q2482380) (← links)
- Two-machine open shop problem with a single server and set-up time considerations (Q2663040) (← links)
- A Heuristic Approach to Assist Side Channel Analysis of the Data Encryption Standard (Q2803642) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
- (Q2861551) (← links)
- Two-machine open shop scheduling with special transportation times (Q3157382) (← links)
- Linear Arrangement Problems and Interval Graphs (Q3195345) (← links)
- Open shop scheduling with delays (Q4020512) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- UET flow shop scheduling with delays (Q4889815) (← links)
- Scheduling job shop problems with operators with respect to the maximum lateness (Q5109793) (← links)
- A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays (Q5418015) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
- Solving the two-machine open shop problem with a single server with respect to the makespan (Q6588513) (← links)
- Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times (Q6602333) (← links)
