A time-dependent multiple criteria single-machine scheduling problem

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  Scott Henderson,et al.  Does Accounting Research Matter , 1978 .

[3]  K. Bhaskar.  A Multiple Objective Approach to Capital Budgeting , 1979 .

[4]  Bernardo Villarreal,et al.  Multicriteria integer programming: A (hybrid) dynamic programming recursive approach , 1981, Math. Program..

[5]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[6]  Robert C. Leachman,et al.  A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem , 1988, Oper. Res..

[7]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[9]  M. Kostreva,et al.  Time Dependency in Multiple Objective Dynamic Programming , 1993 .

[10]  J. M. van den Akker,et al.  LP-based solution methods for single-machine scheduling problems , 1994 .

[11]  Han Hoogeveen,et al.  Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time , 1994, Oper. Res. Lett..

[12]  Han Hoogeveen.  Minimizing Maximum Promptness and Maximum Lateness on a Single Machine , 1996, Math. Oper. Res..

[13]  Gwo-Hshiung Tzeng,et al.  A MULTIOBJECTIVE PROGRAMMING APPROACH FOR SELECTING NON-INDEPENDENT TRANSPORTATION INVESTMENT ALTERNATIVES , 1996 .

[14]  Yong Shi,et al.  Capital budgeting with multiple criteria and multiple decision makers , 1996 .

[15]  Alexander V. Kononov,et al.  Scheduling Problems with Linear Increasing Processing Times , 1997 .

[16]  Murat Köksalan,et al.  Bicriteria Scheduling: Minimizing Flowtime and Maximum Earliness on a Single Machine , 1997 .

[17]  Jatinder N. D. Gupta,et al.  Single machine hierarchical scheduling with customer orders and multiple job classes , 1997, Ann. Oper. Res..

[18]  Murat Köksalan,et al.  Scheduling of Unit Processing Time Jobs on a Single Machine , 1997 .

[19]  T. C. Edwin Cheng,et al.  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..

[20]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..

[21]  T. C. E. Cheng,et al.  The time dependent machine makespan problem is strongly NP-complete , 1999, Comput. Oper. Res..

[22]  Martin W. P. Savelsbergh,et al.  A polyhedral approach to single-machine scheduling problems , 1999, Math. Program..

[23]  S. Thomas McCormick.  Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow , 1999, Oper. Res..

[24]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[25]  Michael M. Kostreva,et al.  Relocation problems arising in conservation biology , 1999 .

[26]  Paolo Toth,et al.  New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..