Si mostrano 100 riferimenti a partire da 1 |

Per ulteriori informazioni selezionare i riferimenti di interesse.

- Cario, MC; Clifford, JJ; Hill, RR; Yang, JW; Yang, KJ; Reilly, CH

An investigation of the relationship between problem characteristics and algorithm performance: a case study of the GAP*IIE TRANSACTIONS*

- Gupta, JND; Hennig, K; Werner, F

Local search heuristics for two-stage flow shop problems with secondary criterion*COMPUTERS & OPERATIONS RESEARCH*

- Bachman, A; Janiak, A; Kovalyov, MY

Minimizing the total weighted completion time of deteriorating jobs*INFORMATION PROCESSING LETTERS*

- Rardin, RL; Uzsoy, R

Experimental evaluation of heuristic optimization algorithms: A tutorial*JOURNAL OF HEURISTICS*

- Szwarc, W; Grosso, A; Della Croce, F

Algorithmic paradoxes of the single-machine total tardiness problem*JOURNAL OF SCHEDULING*

- Dimopoulos, C; Zalzala, AMS

Investigating the use of genetic programming for a classic one-machine scheduling problem*ADVANCES IN ENGINEERING SOFTWARE*

- Chanas, S; Kasperski, A

Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates*ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE*

- T'kindt, V; Billaut, JC

Multicriteria scheduling problems: A survey*RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH*

- Gordon, VS; Werner, F; Yanushkevich, OA

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals*RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH*

- Al-Turki, U

Simple heuristics for the single machine minimum variance scheduling problem*ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING*

- Chang, PC; Su, LH

Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs*COMPUTERS & INDUSTRIAL ENGINEERING*

- Pattloch, M; Schmidt, G; Kovalyov, MY

Heuristic algorithms for lotsize scheduling with application in the tobacco industry*COMPUTERS & INDUSTRIAL ENGINEERING*

- Mondal, SA; Sen, AK

Single machine weighted earliness-tardiness penalty problem with a common due date*COMPUTERS & OPERATIONS RESEARCH*

- Mandel, M; Mosheiov, G

Minimizing maximum earliness on parallel identical machines*COMPUTERS & OPERATIONS RESEARCH*

- Webster, S; Azizoglu, M

Dynamic programming algorithms for scheduling parallel machines with family setup times*COMPUTERS & OPERATIONS RESEARCH*

- Yeung, WK; Oguz, C; Cheng, TCE

Single-machine scheduling with a common due window*COMPUTERS & OPERATIONS RESEARCH*

- Pan, JCH; Chen, JS; Cheng, HL

A heuristic approach for single-machine scheduling with due dates and class setups*COMPUTERS & OPERATIONS RESEARCH*

- Lee, CY; Lei, L

Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases*ANNALS OF OPERATIONS RESEARCH*

- Zhang, F; Tang, GC; Chen, ZL

A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times*OPERATIONS RESEARCH LETTERS*

- Kononov, A; Gawiejnowicz, S

NP-hard cases in scheduling deteriorating jobs on dedicated machines*JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY*

- Chekuri, C; Motwani, R; Natarajan, B; Stein, C

Approximation techniques for average completion time scheduling*SIAM JOURNAL ON COMPUTING*

- Keskinocak, P; Ravi, R; Tayur, S

Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues*MANAGEMENT SCIENCE*

- Lee, WC; Wu, CC

Minimizing the total flow time and the tardiness in a two-machine flow shop*INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE*

- Horiguchi, K; Raghavan, N; Uzsoy, R; Venkateswaran, S

Finite-capacity production planning algorithms for a semiconductor wafer fabrication facility*INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH*

- Ovacik, IM; Rajagopalan, S; Uzsoy, R

Integrating interval estimates of global optima and local search methods for combinatorial optimization problems*JOURNAL OF HEURISTICS*

- Karasakal, EK; Koksalan, M

A simulated annealing approach to bicriteria scheduling problems on a single machine*JOURNAL OF HEURISTICS*

- van den Akker, JM; Hurkens, CAJ; Savelsbergh, MWP

Time-indexed formulations for machine scheduling problems: Column generation*INFORMS JOURNAL ON COMPUTING*

- Woeginger, GJ

When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?*INFORMS JOURNAL ON COMPUTING*

- Armentano, VA; Mazzini, R

A genetic algorithm for scheduling on a single machine with set-up times and due dates*PRODUCTION PLANNING & CONTROL*

- Park, Y; Kim, S; Jun, CH

Performance analysis of re-entrant flow shop with single-job and batch machines using mean value analysis*PRODUCTION PLANNING & CONTROL*

- Wang, GQ; Cheng, TCE

Parallel machine scheduling with batch delivery costs*INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS*

- Biskup, D; Piewitt, W

A note on 'An efficient algorithm for the single-machine tardiness problem'*INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS*

- Steiner, G; Stephenson, P

Subset-restricted interchange for dynamic min-max scheduling problems*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Hoogeveen, JA; Vestjens, APA

A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Mosheiov, G

Minimizing mean absolute deviation of job completion times from the mean completion time*NAVAL RESEARCH LOGISTICS*

- Cheng, TCE; Lin, BMT; Toker, A

Makespan minimization in the two-machine flowshop batch scheduling problem*NAVAL RESEARCH LOGISTICS*

- Yang, XG

Scheduling with generalized batch delivery dates and earliness penalties*IIE TRANSACTIONS*

- Akturk, MS; Ozdemir, D

An exact approach to minimizing total weighted tardiness with release dates*IIE TRANSACTIONS*

- Zhu, ZW; Heady, RB

Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach*COMPUTERS & INDUSTRIAL ENGINEERING*

- Cai, XQ; Zhou, X

Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine*ANNALS OF OPERATIONS RESEARCH*

- Hoogeveen, H; Potts, CN; Woeginger, GJ

On-line scheduling on a single machine: maximizing the number of early jobs*OPERATIONS RESEARCH LETTERS*

- Goemans, MX; Wein, JM; Williamson, DP

A 1.47-approximation algorithm for a preemptive single-machine scheduling problem*OPERATIONS RESEARCH LETTERS*

- Kempf, K; Uzsoy, R; Smith, S; Gary, K

Evaluation and comparison of production schedules*COMPUTERS IN INDUSTRY*

- Tayur, S

Improving operations and quoting accurate lead times in a laminate plant*INTERFACES*

- Kanet, JJ; Sridharan, V

Scheduling with inserted idle time: Problem taxonomy and literature review*OPERATIONS RESEARCH*

- Hill, RR; Reilly, CH

The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance*MANAGEMENT SCIENCE*

- Radhakrishnan, S; Ventura, JA

Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times*INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH*

- Peter, M; Wambach, G

N-extendible posets, and how to minimize total weighted completion time*DISCRETE APPLIED MATHEMATICS*

- Gupta, JND; Palanimuthu, N; Chen, CL

Designing a tabu search algorithm for the two-stage flow shop problem withsecondary criterion*PRODUCTION PLANNING & CONTROL*

- Sox, CR; Jackson, PL; Bowman, A; Muckstadt, JA

A review of the stochastic lot scheduling problem*INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS*

- Hirakawa, Y

A quick optimal algorithm for sequencing on one machine to minimize total tardiness*INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS*

- Segerstedt, A

Lot sizes in a capacity constrained facility with available initial inventories*INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS*

- Chang, PC

A branch and bound approach for single machine scheduling with earliness and tardiness penalties*COMPUTERS & MATHEMATICS WITH APPLICATIONS*

- Danneberg, D; Tautenhahn, T; Werner, F

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size*MATHEMATICAL AND COMPUTER MODELLING*

- Freed, T; Leachman, RC

Scheduling semiconductor device test operations on multihead testers*IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING*

- Baker, KR

Heuristic procedures for scheduling job families with setups and due dates*NAVAL RESEARCH LOGISTICS*

- Koksalan, MM

A heuristic approach to bicriteria scheduling*NAVAL RESEARCH LOGISTICS*

- Ng, CT; Cai, X; Cheng, TCE

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem*NAVAL RESEARCH LOGISTICS*

- Laguna, M

A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times*IIE TRANSACTIONS*

- Li, CL; Cheng, TCE

Due-date determination with resequencing*IIE TRANSACTIONS*

- Liu, JY; Tang, LX

A modified genetic algorithm for single machine scheduling*COMPUTERS & INDUSTRIAL ENGINEERING*

- BALAKRISHNAN N; KANET JJ; SRIDHARAN V

EARLY TARDY SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS ON UNIFORM PARALLEL MACHINES/*Computers & operations research*

- DANIELS RL; HUA SY; WEBSTER S

HEURISTICS FOR PARALLEL-MACHINE FLEXIBLE-RESOURCE SCHEDULING PROBLEMSWITH UNSPECIFIED JOB ASSIGNMENT*Computers & operations research*

- GORDON VS; STRUSEVICH VA

EARLINESS PENALTIES ON A SINGLE-MACHINE SUBJECT TO PRECEDENCE CONSTRAINTS - SLK DUE-DATE ASSIGNMENT*Computers & operations research*

- Holsenback, JE; Russell, RM; Markland, RE; Philipoom, PR

An improved heuristic for the single-machine, weighted-tardiness problem*OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE*

- Allahverdi, A; Gupta, JND; Aldowaisan, T

A review of scheduling research involving setup considerations*OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE*

- Gerodimos, AE; Glass, CA; Potts, CN; Tautenhahn, T

Scheduling multi-operation jobs on a single machine*ANNALS OF OPERATIONS RESEARCH*

- Gupta, JND; Hariri, AMA; Potts, CN

Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs*ANNALS OF OPERATIONS RESEARCH*

- Bianco, L; Dell'Olmo, P; Giordani, S

Minimizing total completion time subject to release dates and sequence-dependent processing times*ANNALS OF OPERATIONS RESEARCH*

- Tanaka, K; Vlach, M

Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine*ANNALS OF OPERATIONS RESEARCH*

- Baptiste, P

An O(n(4)) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs*OPERATIONS RESEARCH LETTERS*

- Chang, CS; Quek, HB; Devotta, JBX

Power system excitation control using master-slave fuzzy power system stabilisers*FUZZY SETS AND SYSTEMS*

- Alidaee, B; Womer, NK

Scheduling with time dependent processing times: Review and extensions*JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY*

- Kellerer, H; Tautenhahn, T; Woeginger, GJ

Approximability and nonapproximability results for minimizing total flow time on a single machine*SIAM JOURNAL ON COMPUTING*

- Sawata, T; Kjaer, PC; Cossar, C; Miller, TJE; Hayashi, Y

Fault-tolerant operation of single-phase SR generators*IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS*

- Sawata, T; Kjaer, PC; Cossar, C; Miller, TJE

A study on operation under faults with the single-phase SR generator*IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS*

- van den Akker, JM; Hoogeveen, JA; van de Velde, SL

Parallel machine scheduling by column generation*OPERATIONS RESEARCH*

- Yang, WH; Liao, CJ

Survey of scheduling research involving setup times*INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE*

- Shafaei, R; Brunn, P

Workshop scheduling using practical (inaccurate) data - Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment usinga rolling time horizon approach*INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH*

- Brucker, P; Knust, S

Complexity results for single-machine problems with positive finish-start time-lags*COMPUTING*

- Qi, XT; Tu, FS

Earliness and tardiness scheduling problems on a batch processor*DISCRETE APPLIED MATHEMATICS*

- CHENG TCE; JANIAK A; KOVALYOV MY

BICRITERION SINGLE-MACHINE SCHEDULING WITH RESOURCE DEPENDENT PROCESSING TIMES*SIAM journal on optimization*

- GUNER E; EROL S; TANI K

ONE MACHINE SCHEDULING TO MINIMIZE THE MAXIMUM EARLINESS WITH MINIMUMNUMBER OF TARDY JOBS*International journal of production economics*

- GLAZEBROOK KD; KULKARNI VG; PURYEAR LC

OPTIMAL SCHEDULING OF READER-WRITER SYSTEMS*Naval research logistics*

- KUBIAK W; VANDEVELDE S

SCHEDULING DETERIORATING JOBS TO MINIMIZE MAKESPAN*Naval research logistics*

- CHENG TCE; CHEN ZL; LI CL; LIN BMT

SCHEDULING TO MINIMIZE THE TOTAL COMPRESSION AND LATE COSTS*Naval research logistics*

- JANIAK A

SINGLE-MACHINE SEQUENCING WITH LINEAR-MODELS OF RELEASE DATES*Naval research logistics*

- CHENG TCE; WANG GQ

BATCHING AND SCHEDULING TO MINIMIZE THE MAKESPAN IN THE 2-MACHINE FLOWSHOP*IIE transactions*

- MEHTA SV; UZSOY R

MINIMIZING TOTAL TARDINESS ON A BATCH PROCESSING MACHINE WITH INCOMPATIBLE JOB FAMILIES*IIE transactions*

- ADAMOPOULOS GI; PAPPIS CP

SCHEDULING UNDER A COMMON DUE-DATE ON PARALLEL UNRELATED MACHINES*European journal of operational research*

- QI XT; TU FS

SCHEDULING A SINGLE-MACHINE TO MINIMIZE EARLINESS PENALTIES SUBJECT TO THE SLK DUE-DATE DETERMINATION METHOD*European journal of operational research*

- Verma, S; Dessouky, M

Single-machine scheduling of unit-time jobs with earliness and tardiness penalties*MATHEMATICS OF OPERATIONS RESEARCH*

- Badics, T; Boros, E

Minimization of half-products*MATHEMATICS OF OPERATIONS RESEARCH*

- TUZIKOV A; MAKHANIOK M; MANNER R

BICRITERION SCHEDULING OF IDENTICAL PROCESSING TIME JOBS BY UNIFORM PROCESSORS*Computers & operations research*

- CRAUWELS HAJ; HARIRI AMA; POTTS CN; VANWASSENHOVE LN

BRANCH-AND-BOUND ALGORITHMS FOR SINGLE-MACHINE SCHEDULING WITH BATCH SET-UP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME*Annals of operation research*

- LIAO LM; LIAO CJ

SINGLE-MACHINE SCHEDULING PROBLEM WITH FUZZY DUE-DATE AND PROCESSING TIME*Zhongguo gongcheng xuekan*

- GASCON A; LEFRANCOIS P; CLOUTIER L

COMPUTER-ASSISTED MULTIITEM, MULTIMACHINE AND MULTISITE SCHEDULING INA HARDWOOD FLOORING FACTORY*Computers in industry*

- VANDERVEEN JAA; WOEGINGER GJ; ZHANG SZ

SEQUENCING JOBS THAT REQUIRE COMMON RESOURCES ON A SINGLE-MACHINE - ASOLVABLE CASE OF THE TSP*Mathematical programming*

- JORDAN C; DREXL A

DISCRETE LOTSIZING AND SCHEDULING BY BATCH SEQUENCING*Management science*

- HUANG SC; LIN JT

AN INTERACTIVE SCHEDULER FOR A WAFER PROBE CENTER IN SEMICONDUCTOR MANUFACTURING*International Journal of Production Research*

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici

Documento generato il 25/02/20 alle ore 10:54:33