The following pages link to Adam Janiak (Q168279):
Displaying 50 items.
- Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
- New perspectives in VLSI design automation: deterministic packing by sequence pair (Q610960) (← links)
- Single machine group scheduling with resource dependent setup and processing times (Q707136) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
- Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
- Time-optimal control in a single machine problem with resource constraints (Q1086143) (← links)
- Single machine scheduling problem with a common deadline and resource dependent release dates (Q1178528) (← links)
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem (Q1262204) (← links)
- Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations (Q1273121) (← links)
- Single machine scheduling subject to deadlines and resource dependent processing times (Q1278308) (← links)
- Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
- Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption (Q1341400) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- (Q1593518) (redirect page) (← links)
- A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519) (← links)
- Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- Job-shop scheduling with resource-time models of operations (Q1820680) (← links)
- Single machine group scheduling with ordered criteria (Q1897384) (← links)
- Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms (Q2255056) (← links)
- The learning effect: getting to the core of the problem (Q2379968) (← links)
- A new approach to the learning effect: Beyond the learning curve restrictions (Q2483519) (← links)
- Scheduling in a contaminated area: a model and polynomial algorithms (Q2491774) (← links)
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs (Q2510197) (← links)
- Mirror image property for the optimal solutions of two single processor scheduling problems with due intervals determination (Q2570212) (← links)
- Batching work and rework processes with limited deterioration of reworkables (Q2581601) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- (Q2712358) (← links)
- (Q2712369) (← links)
- (Q2731287) (← links)
- Scheduling problems with a common due window assignment: A survey (Q2877536) (← links)
- Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources (Q2902362) (← links)
- Scheduling Problems with Learning and Ageing Effects: A Survey (Q2902364) (← links)
- Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects (Q2902366) (← links)
- Resource Management in Machine Scheduling Problems: A Survey (Q3011186) (← links)
- (Q3211101) (← links)
- (Q3216418) (← links)
- (Q3220062) (← links)
- (Q3417375) (← links)
- (Q3481474) (← links)
- Scheduling jobs in a contaminated area: a model and heuristic algorithms (Q3519368) (← links)
- (Q3619079) (← links)
- (Q3619081) (← links)
- (Q3700361) (← links)
- The equivalence of local and global time-optimal control of a complex of operations (Q3702055) (← links)
- (Q3741388) (← links)
