The following pages link to Imed Kacem (Q298759):
Displayed 34 items.
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
- Semi-online scheduling on a single machine with unexpected breakdown (Q306274) (← links)
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs (Q898702) (← links)
- Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic (Q1849826) (← links)
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability (Q1941538) (← links)
- Scheduling on hybrid platforms: improved approximability window (Q2081599) (← links)
- Exact algorithms for scheduling programs with shared tasks (Q2156317) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Competitive difference analysis of the cash management problem with uncertain demands (Q2294663) (← links)
- Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
- (Q2861521) (← links)
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) (← links)
- (Q3109947) (← links)
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
- Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval (Q3195340) (← links)
- (Q3518842) (← links)
- (Q4452949) (← links)
- (Q5697113) (← links)
- Min-max relative regret for scheduling to minimize maximum lateness (Q6182890) (← links)