Scheduling Problems

Topics are

Scheduling Problems with Deterioration
Scheduling Problems with Setup Times
Scheduling Problems with Learning Effects
Scheduling Problems with Earliness and Tardiness
Scheduling Problems with Common Due Date
Scheduling Problems with Multicriteria
Group Scheduling Problems
Fuzzy Scheduling Problems
Using Artificial Immune System
Using Branch and Bound
Using Genetic Algorithm
Using Ant Colony Optimization
Using Simulated Annealing
Using Tabu Search
Using Heuristic Algorithms
Using Neural Networks
Complexity in Scheduling Problems
Reviews in Scheduling Problems
Uncategorized

\begin{equation}{\label{a}}\tag{A}\mbox{}\end{equation}

Scheduling Problems with Deterioration.

\item Bachman, A. and Janiak, A.:
Minimizing Maximum Lateness under Linear Deterioration,
{\em European Journal of Operational Research} 126 (2000) 557-566.

\item Bachman, A., Janiak, A. and Kovalyov, M.:
Minimizing the Total Weighted Completion Time of Deteriorating Jobs,
{\em Information Processing Letter} 81 (2002) 81-84.

\item Huang, X., Wang, J.-B., Wang, L.-Y., Gao, W.-J. and Wang, Z.-R.:
Single Machine Scheduling with Time-Dependent Deterioration and Exponential Learning Effect,
{\em Computers and Industrial Engineering} ???.

\item Lee, W.-C., Wu, C.-C., Wen, C.-C. and Chung, Y.-H.:
A Two-Machine Flowshop Makespan Scheduling Problem with Deteriorating Jobs,
{\em Computers and Industrial Engineering} 54 (2008) 737-749.

\item Moshieov, G.: (Scheduling with Deterioration)
$V$-Shaped Policies for Scheduling Deteriorating Jobs,
{\em Operations Research} 39 (1991) 979-991.

\item Moshieov, G.:
Scheduling Jobs with Step-Deterioration; Minimizing Makespan on a
Single-Machine and Multi-Machine,
{\em Computers and Industrial Engineering} 28 (1995) 869-879.

\item Shiau, Y.-R., Lee, W.-C., Wu, C.-C. and Chang, C.-M.:
Two-Machine Flowshop Scheduling to Minimize Mean Flow Time under Simple
Linear Detrioration,
{\em International Journal of Advanced Manufacturing Technology} ???

\item Wang, J.-B.:
Flow Shop Scheduling Problems with Decreasing Linear Deterioration under
Dominant Machines,
{\em Computers and Operations Research} 34 (2007) 2043-2058.

\item Wang, J.-B.:
Single-Machine Scheduling Problems with the Effects of Learning and Deterioration,
{\em Omega} 35 (2007) 397-402.

\item Wang, J.-B. and Liu, L.-L.:
Two-Machine Flow Shop Scheduling with Linear Decreasing Job Deterioration,
{\em Computers and Industrial Engineering} 56 (2009) 1487-1493.

\item Wang, J.-B. and Liu, L.-L.:
Two-Machine Flow Shop Problem with Effects of Deterioration and Learning,
{\em Computers and Industrial Engineering} 56 (2009) 1487-1493.

\item Wu, C.-C. and Lee, W.-C.:
Two-Machine Flowshop Scheduling to Minimize Mean Flow Time under Linear Deterioration,
{\em International Journal of Production Economics} 103 (2006) 572-584.

\item Wu, C.-C., Lee, W.-C. and Shiau, Y.-R.:
Minimizing the Total Weighted Completion Time on a Single Machine under Linear Deterioration,
{\em International Journal of Advanced Manufacturing Technology} ???

\begin{equation}{\label{b}}\tag{B}\mbox{}\end{equation}

Scheduling Problems with Setup Times.

\item Biskup, D. and Herrmann, J.:
Single-Machine Scheduling Against Due Dates with Past-Sequence-Dependent Steup Times,
{\em Europenan Journal of Operational Research} 191 (2008) 587-592.

\item Gawiejnowicz, S., Kurc, W. and Pankowska, L.:
Equivalent Time-Dependent Scheduling Problems,
{\em European Journal of Operational Research} 196 (2009) 919-929.

\item Gupta, S.R. and Smith, J.S.:
Algorithms for Single Machine Total Tardiness Scheduling with Sequence Dependent Setups,
{\em European Journal of Operational Research} 175 (2006) 722-739.

\item Tan, K.C., Narasimhan, R., Rubin, P.A. and Ragatz, G.L.:
A Comparison of Four Methods for Minimizing Total Tardiness on a Single Processor with Sequence Dependent Setup Times,
{\em Omega} 28 (2000) 313-326.

\item Zhu, V.C.Y., Sun, L., Sun, L. and Li, X.:
Single-Machine Scheduling Time-Dependent Jobs with Resource-Dependent Ready Times,
{\em Computers and Industrial Engineering} ???

\begin{equation}{\label{c}}\tag{C}\mbox{}\end{equation}

Scheduling Problems with Learning Effects.

\item Bachman, A. and Janiak, A.:
Scheduling Jobs with Position-Dependent Processing Times,
{\em Journal of Operational Research Society} 55 (2004) 257-264.

\item Bardiru, A.B.:
Computational Survey of Univariate and Multivariate Learning Curve Models,
{\em IEEE Trans. on Engineering Management} 39 (1992) 176-188.

\item Biskup, D.:
Single-Machine Scheduling with Learning Considerations,
{\em European Journal of Operational Research} 115 (1999) 173-178.

\item Biskup, D.:
A State-of-the-art Review on Scheduling with Learning Effects,
{\em European Journal of Operational Research} 188 (2008) 315-329.

\item Biskup, D. and Simons, D.:
Common Due Date Scheduling with Autonomous and Induced Learning,
{\em Europenan Journal of Operational Research} 159 (2004) 606-616.

\item Cheng, T.C.E., Lai, P.-J., Lee, W.-C. and Wu, C.-C.:
Single-Machine Scheduling with Sum-of-Logarithm-Processing-Times-Based Learning Considerations,
{\em Information Sciences} 179 (2009) 3127-3135.

\item Cheng, T.C.E. and Wang, G.:
Single Machine Scheduling with Learning Effect Considerations,
{\em Annals of Operations Research} 98 (2000) 273-290.

\item Cheng, T.C.E., Wu, C.-C. and Lee, W.-C.:
Some Scheduling Problems with Deteriorating Jobs and Learning Effects,
{\em Computers and Industrial Engineering} 54 (2008) 972-982.

\item Cheng, T.C.E., Wu, C.-C. and Lee, W.-C.:
Some Scheduling Problems with Sum-of-Processing-Times-Based and Job-Position-Based Learning Effects,
{\em Information Sciences} 178 (2008) 2476-2487.

\item Dondeti, V.R. and Mohanty, B.B.:
Impact of Learning and Fatigue Factors on Single Machine Scheduling
with Penalties for Tardy Jobs,
{\em Europenan Journal of Operational Research} 105 (1998) 509-524.

\item Janiak, A., Janiak, W.A., Rudek, R. and Wielgus, A.:
Solution Algorithms for the Makespan Minimization Problem with the General Learning Model,
{\em Computers and Industrial Engineering} 56 (2009) 1301-1308.

\item Janiak, A. and Rudek, R.:
A New Approach to the Learning Effect: Beyond the Learning Curve Restrictions,
{\em Computers and Operations Research} 35 (2008) 3727-3726.

\item Koulamas, C. and Kyparisis, G.J.:
Single-Machine and Two-Machine Flowshop Scheduling with General Learning
Functions,
{\em European Journal of Operational Research} 178 (2007) 402-407.

\item Kuo, W.-H. and Yang, D.-L.:
Single-Machine Group Scheduling with a Time-Dependent Learning Effect,
{\em Computers and Operations Research} 33 (2006) 2099-2112.

\item Kuo, W.-H. and Yang, D.-L.:
Minimizing the Total Completion Time in a Single-Machine Scheduling
Problem with a Time-Dependent Learning Effect,
{\em European Journal of Operational Research} 174 (2006) 1184-1190.

\item Kuo, W.-H. and Yang, D.-L.:
Minimizing the Makespan in a Single Machine Scheduling Problem with a
Time-Based Learning Effect,
{\em Information Processing Letter} 97 (2006) 64-67.

\item Lee, W.-C. and Wu, C.-C.:
Minimizing Total Completion Time in a Two-Machine Flowshop with a Learning Effect,
{\em International Journal of Production Economics} 88 (2004) 85-93.

\item Lee, W.-C. and Wu, C.-C.:
Some Single-Machine and $m$-Machine Flowshop Scheduling Problems with Learning Considerations,
{\em Information Sciences} 179 (2009) 3885-3892.

\item Lee, W.-C., Wu, C.-C. and Sung, H.-J.:
A Bi-Criterion Single-Machine Scheduling Problem with Learning Considerations,
{\em Acta Informatica} 40 (2004) 303-315.

\item Mani, V., Chang, P.C. and Chen, S.H.:
Bi-criteria Single Machine Scheduling Problem with a Learning Effect: Aneja-Nair Method to Obtain the Set of Optimal Sequences,
{\em Computers and Mathematics with Applications} 58 (2009) 39-47.

\item Moshieov, G.:
Scheduling Problems with a Learning Effect,
{\em European Journal of Operational Research} 132 (2001) 687-693.

\item Moshieov, G.:
Parallel Machine Scheduling with a Learning Effect,
{\em Journal of Operational Research Society} 52 (2001) 1165-1169.

\item Moshieov, G. and Sidney, J.B.:
Scheduling with General Job-Dependent Learning Curves,
{\em European Journal of Operational Research} 147 (2003) 665-670.

\item Moshieov, G. and Sidney, J.B.:
Note on Scheduling with General Learning Curves to Minimize the Number of Tardy Jobs,
{\em Journal of Operational Research Society} 56 (2005) 110-112.

\item Sun, J.:
Single-Machine Scheduling Problems with Deteriorating Jobs and Learning Effect,
{\em Computers and Industrial Engineering} 57 (2009) 843-846.

\item Toksari, M.D., Oron, D. and G\”{u}ner, E.:
Single Machine Scheduling Problems under the Effects of Nonlinear Deterioration and Time-Dependent Learning,
{\em Mathematical and Computer Modelling} 50 (2009) 401-406.

\item Wang, J.-B.:
Single-Machine Scheduling Problems with the Effects of Learning and Deterioration,
{\em Omega} 35 (2007) 397-402.

\item Wang, J.-B.:
Single-Machine Scheduling with Past-Sequence-Dependent Setup Times and Time-Dependent Learning Effect,
{\em Computers and Industrial Engineering} 55 (2008) 584-591.

\item Wang, J.-B.:
Single-Machine Scheduling with Learning Effects and Deteriorating Jobs,
{\em Computers and Industrial Engineering} ???.

\item Wang, J.-B. and Liu, L.-L.:
Two-Machine Flow Shop Problem with Effects of Deterioration and Learning,
{\em Computers and Industrial Engineering} 56 (2009) 1487-1493.

\item Wang, J.-B., Ng, C.T., Cheng, T.C.E. and Liu, L.L.:
Single-Machine Scheduling with a Time-Depedent Learning Effect,
{\em International Journal of Production Economics} 111 (2008) 802-811.

\item Wangm J.-B. and Xia, Z.-Q.:
Flow Shop Scheduling with a Learning Effect,
{\em Journal of Operational Research Society} 56 (2005) 1325-1330.

\item Wang, J.-B., Wang, D., Wang, L.-Y., Lin, L., Yin, N. and Wang, W.-W.:
Single Machine Scheduling with Exponential Time-Dependent Learning Effect and Past-Sequence-Dependent Setup Times,
{\em Computers and Mathematics with Applications} 57 (2009) 9-16.

\item Wang, X. and Cheng, T.C.E.:
Single-Machine Scheduling with Deteriorating Jobs and Learning Effects
to Minimize the Makespan,
{\em European Journal of Operational Research} 178 (2007) 57-70.

\item Wu, C.-C.:
The Development of a Solution to the Single-Machine Total Weighted Completion Time Problem with a Learning Effect,
{\em International Journal of Management} 23 (2006) 113-116.

\item Wu, C.-C. and Lee, W.-C.:
A Note on Single-Machine Scheduling with Learning Effect and an Availability Constraint,
{\em International Journal of Advanced Manufacturing Technology} ???

\item Wu, C.-C. and Lee, W.-C.:
Single-Machine and Flowshop Scheduling with a General Learning Effect Model,
{\em Computers and Industrial Engineering} 56 (2009) 1553-1558.

\item Wu, C.-C. and Lee, W.-C.:
A Note on the Total Completion Time Problem in a Permutation Flowshop with a Learning Effect,
{\em European Journal of Operational Research} 192 (2009) 343-347.

\item Wu, C.-C., Lee, W.-C. and Chen, T.:
Heuristic Algorithms for Solving the Maximum Lateness Scheduling Problem with Learning Considerations,
{\em Computers and Industrial Engineering} 52 (2007) 124-132.

\item Wu, C.-C., Lee, W.-C. and Wang, W.-C.:
A Two-Machine Flowshop Maximum Tardiness Scheduling Problem with a Learning Effect,
{\em International Journal of Advanced Manufacturing Technology} 31 (2007) 743-750.

\item Xu, Z., Sun, L. and Gong, J.:
Worst-case Analysis for Flow Shop Scheduling with a Learning Effect,
{\em International Journal of Production Economics} 113 (2008) 748-753.

\item Yang, D.-L. and Kuo, W.-H.:
A Single-Machine Scheduling Problem with Learning Effects in Intermittent Batch Production,
{\em Computers and Industrial Engineering} 57 (2009) 762-765.

\item Yang, D.-L. and Kuo, W.-H.:
Some Scheduling Problems with Deteriorating Jobs and Learning Effects,
{\em Computers and Industrial Engineering} ???.

\item Yang, W.-H. and Chand, S.:
Learning and Forgetting Effects on a Group Sheduling Problem,
{\em European Journal of Operational Research} 187 (2008) 1033-1044.

\item Yin, Y., Xu, D., Sun, K. and Li, H.:
Some Scheduling Problems with General Position-Dependent and Time-Dependent Learning Effects,
{\em Information Sciences} 179 (2009) 2416-2425.

\item Zhang, X. and Yan, G.:
Machine Scheduling Problems with a General Learning Effect,
{\em Mathematical and Computer Modelling} ???

\begin{equation}{\label{d}}\tag{D}\mbox{}\end{equation}

Scheduling Problems with Earliness and Tardiness.

\item Alidaee, B. and Panwalkar, S.S.:
Single Stage Minimum Absolute Lateness Problem with a Common Due Date on
Non-Identical Machines,
{\em Journal of Operational Research Society}44 (1993) 29-36.

\item Asano, M. and Ohta, H.
Single Machine Scheduling Using Dominance Relation to Minimize Earliness
Subject to Ready and Due Times,
{\em International Journal of Prouction Economics} 44 (1996) 35-43.

\item Azizo\'{v}g}lu, M.:
Preemptive Scheduling on Identical Parallel Machines Subject to Deadlines,
{\em European Journal of Operational Research} 148 (2003) 205-210.

\item Bagchi, U., Sullivan, R.S. and Chang, Y.-L.:
Minimizing Mean Squared Deviation of Completion Times about a Common
Due Date,
{\em Management Science} 33 (1987) 894-904.

\item Bank, J. and Werner, F.:
Heuristic Algorithms for Unrelated Parallel Machine Scheduling with a
Common Due Date, Release Dates, and Linear Earliness and Tardiness
Penalties,
{\em Mathematical and Computer Modelling} 33 (2001) 363-383.

\item Baptiste, P.:
On Minimizing the Weighted Number of Late Jobs in Unit Execution Time
Open-Shops,
{\em European Journal of Operational Research} 149 (2003) 344-354.

\item Bauman, J. and Jozefowska, J.:
Minimizing the Earliness-Tardiness Costs on a Single Machine,
{\em Computers and Operations Research} 33 (2006) 3219-3230.

\item Cai, X., Lum, V.Y.S. and Chan, J.M.T.:
Scheduling about a Common Due Date with Job-Dependent Asymmetric Earliness
and Tardiness Penalties,
{\em European Journal of Operational Research} 98 (1997) 154-168.

\item Chen, Z.-L.:
Scheduling and Common Due Date Assignment with Earliness-Tardiness
Penalties and Batch Delivery Costs,
{\em European Journal of Operational Research} 93 (1996) 49-60.

\item Cheng, T.C.E.:
Optimal Due-Date Detrmination and Sequencing of $n$ Jobs on a Single Machine,
{\em Journal of Operational Research Society} 35 (1984) 433-437.

\item Cheng, T.C.E.:
A Note on the Common Due-Date Assignment Problem,
{\em Journal of Operational Research Society} 37 (1986) 1089-1901.

\item Cheng, T.C.E.:
A Note on a Partial Seqrch Algorithm for the Single-Machine Optimal
Common Due-Date Assignment and Sequencing Problem.
{\em Computers and Operations Research} 17 \# 3 (1990) 321-324.

\item Cheng, T.C.E.:
Optimal Constant Due Date Determination and Sequencing of $n$ Jobs on a
Single Machine,
{\em International Journal of Production Economics} 22 (1991) 259-261.

\item Cheng, T.C.E., Oguz, C. and Qi, X.D.:
Dua Date Assignment and Single Machine Scheduling with Compressible
Processinh Times,
{\em International Journal of Production Economics} 43 (1996) 29-35.

\item Cho, Y. and Sahni, S.:
Preemptive Scheduling of Independent Jobs with Release and Due Times on Open,
Flow and Job Shops,
{\em Operations Research} 29 (1981) 511-522.

\item Crauwels, H.A.J., Potts, C.N. and Van Wassenhove, L.N.:
Local Search Heuristics for the Single Machine Total Weighted Tardiness
Scheduling Problem,
{\em INFORMS Journal on Computing} 10 (1998) 341-350.

\item Croce, F.D., Gupta, J.N.D. and Tadei, R.:
Minimizing Tardy Jobs in a Flowshop with Common Due Date,
{\em European Journal of Operational Research} 120 (2000) 375-381.

\item de Bontridder, K.M.J.:
Minimizing Total Weighted Tardiness in a Generalized Job Shop,
{\em Journal of Scheduling} 8 (2005) 479-496.

\item De, P., Ghosh, J.B. and Wells, C.E.:
A Note on the Minimization of Mean Squared Deviation of Completion Times
about a Common Due Date,
{\em Management Science} 35 (1989) 1143-1147.

\item De, Prabuddha, Ghosh, J.B. and Wells, C.E.:
On the Multiple-Machine Extension to a Common Due-Date Assignment and
Scheduling Problem,
{\em Journal of Operational Research Society} 42 (1991) 419-422.

\item Emmons, H.:
One-Machine Sequencing to Minimize Certain Functions of Job Tardiness,
{\em Operations Research} 17 (1969) 701-715.

\item Ergun, O. and Orlin, J.B.:
Fast Neighborhood Search for the Single Machine Total Weighted Tardiness
Problem,
{\em Operations Research Letters} 34 (2006) 41-45.

\item Fry, T.D., Armstrong, R.D. and Blackstone, J.H.:
Minimizing Weighted Absolute Deviation in Single Machine Scheduling,
{\em IIE Trasnsactions} 19 (1987) 445-450.

\item Hall, N.G. and Posner, M.E.:
Earliness-Tardiness Scheduling Problems I: Weighted Deviation of Completion
Times about a Common Due Date; II: Deviation of Completion Times about
a Restrictibe Common Due Date,
{\em Operations Research} 39 (1991) 836-856.

\item Hall, N.G., Sethi, S.P. and Sriskandarajah, C.:
On the Complexity of Generalized Due Date Scheduling Problems,
{\em European Journal of Operational Research} 51 (1991) 100-109.

\item Hendel, Y. and Sourd, F.:
Efficient Neighborhood Search for the One-Machine Earliness-Tardiness
Scheduling Problem,
{\em European Journal of Operational Research} 173 (2006) 108-119.

\item Herrmann, J.W. and Lee, C.-Y.:
On Scheduling to Minimize Earliness-Tardiness and Batch Delivery Costs
with a Common Due Date,
{\em European Journal of Operational Research} 70 (1993) 272-288.

\item James, R.J.W.:
Using Tabu Search to Solve the Commond Due Date Early/Tardy Machine
Scheduling Problem,
{\em Computers and Operations Research} 24 (1997) 199-208.

\item Kahlbacher, H.G. and Cheng, T.C.E.:
Parallel Machine Scheduling to Minimize Costs for Earliness and Number
of Tardy Jobs,
{\em Discrete Applied Mathematics} 47 (1993) 139-164.

\item Kise, H., Ibaraki, T. and Mine, H.:
A Solvable Case of the One-Machine Scheduling Problem with Ready and
Due Time,
{\em Operations Research} 26 (1978) 121-126.

\item K\”{o}ksalan, M., Azizoglu, M. and Kondakci, S.K.:
Minimizing Flowtime and Maximum Earliness on a Single Machine,
{\em IIE Transactions} 30 (1998) 192-200.

\item Kovalyov, M.Y. and Kubiak, W.:
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem,
{\em Operations Research} 47 (1999) 757-761.

\item Laguna, M., Lino, P., P\'{e}rez, A., Quintanilla, S. and Valls, V.:
Minimizing Weighted Tardiness of Jobs with Stochastic Interruptions in Parallel Machines,
{\em European Journal of Operational Research} 127 (2000) 444-457.

\item Lakshminarayan, S., Lakshmanan, R., Papineau, R.L. and Rochette, R.:
Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties,
{\em Operations Research} 26 (1978) 1079-1082.

\item Lauff, V. and Werner, F.:
Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey,
{\em Mathematical and Computer Modelling} 40 (2004) 637-655.

\item Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G.:
Minimizing Maximum Lateness in a Two-Machine Open Shop,
{\em Mathematics of Operations Research} 6 (1981) 153-158.

\item Lee, C.-Y., Danusaputro, S.L. and Lin, C.-S.:
Minimizing Weighted Number of Tardy Jobs and Weighted Earliness-Tardiness Penalties about a Common Due Date,
{\em Computers and Operations Research} 18 (1991) 379-389.

\item Lee, C.-Y. and Kim, S.J.:
Parallel Genetic Algorithms for the Earliness-Tardiness Job Scheduling Problem with General Penalty Weightsm
{\em Computers and Industrial Engineering} 28 (1995) 231-243.

\item Lin, B.M.T.:
Scheduling in the Two-Machines Flowshop with Due Date Constraints,
{\em International Journal of Production Economics} 70 (2001) 117-123.

\item Lin, B.M.T.:
Fabrication Scheduling on a Single Machine with Due Date Constraints,
{\em European Journal of Operational Research} 136 (2002) 95-105.

\item Lin, B.M.T. and Cheng, T.C.E.:
Minimizing the Weighted Number of Tardy Jobs and Maximum Tardiness in
Relocation Problem with Due Date Constraints,
{\em European Journal of Operational Research} 116 (1999) 183-193.

\item McMahon, G. and Florian, M.:
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness,
{\em Operations Research} 23 (1975) 475-482.

\item McNaughton, R.:
Scheduling with Deadlines and Loss Functions,
{\em Management Science} 6 (1959) 1-12.

\item Mondal, S.A. and Sen, A.K.:
Single Machine Weighted Earliness-Tardiness Penalty Problem with a
Common Due Date,
{\em Computers and Operations Research} 28 (2001) 649-669.

\item Mosheiov, G. and Yovel, U.:
Minimizing Weighted Earliness-Tardiness and Due-Date Cost with Unit
Processing-Time Jobs,
{\em European Journal of Operational Research} 172 (2006) 528-544.

\item Ow, P.S. and Morton, T.E.:
The Single Machine Early/Tardy Problem,
{\em Management Science} 35 (1989) 177-191.

\item Panwalker, S.S., Smith, M.L. and Seidmann, A.:
Common Due Date Assignment to Minimize Total Penalty for the One Machine
Scheduling Problem,
{\em Operations Research} 30 (1982) 391-399.

\item P\'{e}ridy, L., Pinson, E. and Rivreau, D.:
Using Short-Term Mempry to Minimize the Weighted Number of Late Jobs on a
Single Machine,
{\em European Journal of Operational Research} 148 (2003) 591-603.

\item Posner, M.E.:
Minimizing Weighted Completion Times with Deadlines,
{\em Operations Research} 33 (1985) 562-574.

\item Potts, C.N.:
Analysis of a Heuristic for One Machine Sequencing with Release Dates and
Delivery Times,
{\em Operations Research} 28 (1980) 1436-1441.

\item Potts, C.N. and Van Wassenhove, L.N.:
Algorithms for Scheduling a Single Machine to Minimize the Weighted
Number of Late Jobs,
{\em Management Science} 34 (1988) 843-858.

\item Rajendran, C. and Ziegler, H.:
Heuristics for Scheduling in Flowshops and Flowline-Based Manufacturing Cells to Minimize the Sum of Weighted Flowtime and Weighted Tardiness of Jobs,
{\em Computers and Industrial Engineering} 37 (1999) 671-690.

\item Rajendran, C. and Ziegler, H.:
Scheduling to Minimize teh Sum of Weighted Flowtime and Weighted Tardiness of Jobs in a Flowshop with Sequence-Dependent Setup Times,
{\em European Journal of Operational Research} 149 (2003) 513-522.

\item Sidney, J.B.:
Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties,
{\em Operations Research} 25 (1977) 62-69.

\item S\”{u}er, G.A., B\'{a}ez, E. and Czajkiewicz, Z.:
Minimizing the Number of Tardy Jobs in Identical Machine Scheduling,
{\em Computers and Industrial Engineering} 25 (1993) 243-246.

\item Tang, L., Xuan, H. and Liu, J.:
A New Lagrangian Relaxation Algorithm for Hybrid Flowshop Schdeuling to Minimize Total Weighted Completion Time,
{\em Computers and Operations Research} 33 (2006) 3344-3359.

\item Wu, C.-C., Lee, W.-C. and You, J.-M.:
Trade-Off Solutions in a Single-Machine Scheduling Problem for Minimizing Total Earliness and Maximum Tardiness,
{\em International Journal of Systems Science} 31 (2000) 639-647.

\begin{equation}{\label{e}}\tag{E}\mbox{}\end{equation}

Scheduling Problems with Common Due Date.

\item Adamopoulos, G.I. and Pappis, C.P.:
Scheduling under a Common Due Date on Parallel Unrelated Machines,
{\em European Journal of Operational Research} 105 (1998) 494-501.

\item Azizoglu, M. and Webster, S.:
Scheduling about an Unrestricted Common Due Window with Arbitrary Earliness/Tardiness Penalty Rates,
{\em IIE Translations} 29 (1997) 1001-1006.

\item Azizoglu, M. and Webster, S.:
Scheduling Job Families about an Unrestricted Common Due Date on a Single Machine,
{\em International Journal of Production Research} 35 (1997) 1321-1330.

\item Bank, J. and Werner, F.:
Heuristic Algorithms for Unrelated Parallel Machine Scheduling with a Common Due Date, Release Dates, and Linear Earliness and Tardiness Penalties,
{\em Mathematical and Computer Modelling} 33 (2001) 363-383.

\item Biskup, D. and Feldmann, M.:
Benchmarks for Scheduling on a Single Machine against Restrictive and Unrestrictive Common Due Date,
{\em Computers and Operations Research} 28 (2001) 787-801.

\item Biskup, D. and Jahnke, H.:
Common Due Date Assignment for Scheduling on a Single Machine with Jointly Reducible Processing Times,
{\em International Journal of Production Economics} 69 (2001) 317-322.

\item Biskup, D. and Simons, D.:
Common Due Date Scheduling with Autonomous and Induced Learning,
{\em Europenan Journal of Operational Research} 159 (2004) 606-616.

\item Cai, X., Lum, V.Y.S. and Chan, J.M.T.:
Scheduling about a Common Due Date with Job-Dependent Asymmetric Earliness and Tardiness Penalties,
{\em European Journal of Operational Research} 98 (1997) 154-168.

\item Chen, D., Li, S. and Tang, K.:
Single Machine Scheduling with Common Due Date Assignment in a Group Technology Environment,
{\em Mathematical and Computer Modelling} 25 (1997) 81-90.

\item Chen, Z.-L.:
Scheduling and Common Due Date Assignment with Earliness-Tardiness Penalties and Batch Delivery Costs,
{\em European Journal of Operational Research} 93 (1996) 49-60.

\item Cheng, T.C.E. and Kovalyov, M.Y.:
Batch Scheduling and Common Due Date Assignment on a Single Machine,
{\em DIscrete Applied Mathematics} 70 (1996) 231-245.

\item Croce, F.D., Gupta, J.N.D. and Tadei, R.:
Minimizing Tardy Jobs in a Flowshop with Common Due Date,
{\em European Journal of Operational Research} 120 (2000) 375-381.

\item Hao, Q., Yang, Z., Wang, D. and Li, Z.:
Common Due Date Determination and Sequencing Using Tabu Search,
{\em Compuetrs and Operations Research} 23 (1996) 409-417.

\item Herrmann, J.W. and Lee, C.-Y.:
On Scheduling to Minimize Earliness-Tardiness and Batch Delivery Costs with a Common Due Date,
{\em European Journal of Operational Research} 70 (1993) 272-288.

\item James, R.J.W.:
Using Tabu Search to Solve the Commond Due Date Early/Tardy Machine Scheduling Problem,
{\em Computers and Operations Research} 24 (1997) 199-208.

\item Lauff, V. and Werner, F.:
Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey,
{\em Mathematical and Computer Modelling} 40 (2004) 637-655.

\item Liao, C.-J. and Cheng, C.-C.:
A Variable Neighborhood Search for Minimizing Single Machine Weighted Earliness and Tardiness with Common Due Date,
{\em Computers and Industrial Engineering} 52 (2007) 404-413.

\item Liman, S.D., Panwalker, S.S. and Thongmee, S.:
Determination of Common Due Window Location in a Single Machine Scheduling Problem,
{\em European Journal of Operational Research} 93 (1996) 68-74.

\item Sarper, H.:
Minimizing the Sum of Absolute Deviations about a Common Due Date for the Two-Machine Flow Shop Problems,
{\em Applied Mathematical Modelling} 19 (1995) 153-161.

\item Szwarc, W.:
The Weighted Common Due Date Single Machine Scheduling Problem Revisited,
{\em Computers and Operations Research} 23 (1996) 255-262.

\item Wilamowsky, Y., Epstein, S. and Dickman, B.:
Optimal Common Due Date with Completion Time Tolerance,
{\em Computers and Operations Research} 23 (1996) 1203-1210.

\item Yeung, W.K., Oguz, C. and Cheng, T.C.E.:
Single-Machine Scheduling with a Common Due Window,
{\em Computers and Operations Research} 28 (2001) 157-175.

\begin{equation}{\label{f}}\tag{F}\mbox{}\end{equation}

Scheduling Problems with Multicriteria.

\item Allahverdi, A.:
The Two- and $m$-Machine Flowshop Scheduling Problems with Bicriteria of Makespan and Mean Flowtime,
{\em European Journal of Operational Research} 147 (2003) 373-396.

\item Allahverdi, A. and Aldowaisan, T.:
No-wait Flowshop with Bicriteria of Makespan and Maximum Lateness,
{\em European Journal of Operational Research} 152 (2004) 132-147.

\item Allouche, M.A., Aouni, B., Martel, J.-M., Loukil, T. and Rebai, A.:
Solving Multi-Criteria Scheduling Flow Shop Problem through Compromise Programming and Satisfaction Functions,
{\em European Journal of Operational Research} 192 (2009) 460-467.

\item Bagchi, U.:
Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems,
{\em Operations Research} 37 (1989) 118-125.

\item Chen, C.-L. and Bulfin, R.L.:
Complexity of Single Machine, Multi-Criteria Scheduling Problems,
{\em European Journal of Operational Research} 70 (1993) 115-125.

\item Cheng, T.C.E., Kovalyov, M.Y. and Tuzikov, A.V.:
Single Machine Group Scheduling with Two Ordered Criteria,
{\em The Journal of Operational Research Society} 47 (1996) 315-320.

\item Chou, F.-D. and Lee, C.-E.:
Two-Machine Flowshop Scheduling with Bicriteria Problem,
{\em Computers and Industrial Engineering} 36 (1999) 549-564.

\item De, P., Ghosh, J.B. and Wells, C.E.:
On the Minimization of Completion Time Variance with a Bicriteria Extension,
{\em Operations Research} 40 (1992) 1148-1155.

\item Forst, F.G.:
Bicriterion Stochastic Scheduling on One or More Machines,
{\em European Journal of Operational Research} 80 (1995) 404-409.

\item Fry, T.D., Armstrong, R.D. and Lewis, H.:
A Framework for Single Machine Multiple Objective Sequencing Research,
{\em OMEGA} 17 (1989) 595-607.

\item Geiger, M.J.:
On Operators and Search Space Topology in Multi-Objective Flow Shop
Scheduling,
{\em European Journal of Operational Research} 181 (2007) 195-206.

\item Gupta, J.N.D., Neppalli, V.R. and Werner, F.:
Minimizing Total Flow Time in a Two-Machine Flowshop Problem with Minimum
Makespan,
{\em International Journal of Production Economics} 69 (2001) 323-338.

\item Gupta, J.N.D., Palanimuthu, N. and Chen, C.-L.:
Designing a Tabu Search Algorithm for the Two-Stage Flow Shop Problem
with Secondary Criterion,
{\em Production Planning and Control} 10 (1999) 251-265.

\item Hoogeveen, H.:
Multicriteria Scheduling,
{\em European Journal of Operational Research} 167 (2005) 592-623.

\item Ismayilova, N.A., Sa\v{g}ir, M. and Gasimov, R.:
A Multiobjective Faculty-Course-Time Slot Assignment Problem with Preferences,
{\em Mathematical and Computer Modelling} 46 (2007) 1017-1029.

\item Nagar, A., Haddock, J. and Heragu, S.:
Multiple and Bicriteria Scheduling: A Literature Survey,
{\em European Journal of Operational Research} 81 (1995) 88-104.

\item Nelson, R.T., Sarin, R.K. and Daniels, R.L.:
Scheduling with Multiple Performance Measures: The One-Machine Case,
{\em Management Science} 32 (1986) 464-479.

\item Rajendran, C.:
Two-Stage Flowshop Scheduling Problem with Bicriteria,
{\em Journal of the Operational Research Society} 43 (1992) 871-884.

\item Rajendran, C.:
A Heuristic for Scheduling in Flowshop and Flowline-Based Manufacturing
Cell with Multi-Criteria,
{\em International Journal of Production Research} 32 (1994) 2541-2558.

\item Rajendran, C.:
Heuristic for Scheduling in Flowshop with Multiple Objectives,
{\em European Journal of Operational Research} 82 (1995) 540-555.

\item Rajendran, C. and Ziegler, H.:
An Efficient Heuristic for Scheduling in a Flowshop to Minimize Total
Weighted Flowtime of Jobs,
{\em European Journal of Operational Research} 103 (1997) 129-138.

\item Sayin, S. and Karabati, S.:
A Bicriteria Approach to the Two-Machine Flow Shop Scheduling Problem,
{\em European Journal of Operational Research} 113 (1999) 435-449.

\item Slany, W.:
Scheduling as a Fuzzy Multiple Criteria Optimization Problem,
{\em Fuzzy Sets and Systems} 78 (1996) 197-222.

\item Tay, J.C. and Ho, N.B.:
Evolving Dispatching Rules Using Genetic Programming for Solving
Multi-Objective Flexible Job-Shop Problems,
{\em Computers and Industrial Engineering} 54 (2008) 453-473.

\item Wang, C., Chu, C. and Proth, J.-M.:
Heuristic Approaches for $n/m/F/\sum C_{i}$ Scheduling Problems,
{\em European Journal of Operational Research} 96 (1997) 636-644.

\item Yeh, W.-C.:
A New Branch-and-Bound Approach fpr the $n/2/flowshop/\alpha F+\beta
C_{\max}$ Flowshop Scheduling Problem,
{\em Computers and Operations Research} 26 (1999) 1293-1310.

\item Yeh, W.-C.:
An Efficient Branch-and-Bound Algorithm for the Two-Machine Bicriteria
Flowshop Scheduling Problem,
{\em Journal of Manufacturing Systems} 20 (2001) 113-123.

\begin{equation}{\label{g}}\tag{G}\mbox{}\end{equation}

Group Scheduling Problems.

\item Chen, D., Li, S. and Tang, K.:
Single Machine Scheduling with Common Due Date Assignment in a Group
Technology Environment,
{\em Mathematical and Computer Modelling} 25 (1997) 81-90.

\item Cheng, T.C.E., Kovalyov, M.Y. and Tuzikov, A.V.: (Multicriteria Problems in Scheduling)
Single Machine Group Scheduling with Two Ordered Criteria,
{\em The Journal of Operational Research Society} 47 (1996) 315-320.

\item Janiak, A., Kovalyov, M.Y., Portmann, M.-C.:
Single Machine Group Scheduling with Resource Dependent Setup and Processing
Times,
{\em European Journal of Operational Research} 162 (2005) 112-121.

\item Kuo, W.-H. and Yang, D.-L.:
Single-Machine Group Scheduling with a Time-Dependent Learning Effect,
{\em Computers and Operations Research} 33 (2006) 2099-2112.

\item Logendran, R., Carson, S. and Hanson, E.:
Group Scheduling in Flexible Flow Shops,
{\em International Journal of Production Economics} 96 (2005) 143-155.

\item Logendran, R., deSzoeke, P. and Barnard, F.:
Sequence-Dependent Group Scheduling Problems in Flexible Flow Shops,
{\em International Journal of Production Economics} 102 (2006) 66-86.

\item Logendran, R., Mai, L. and Talkington, D.:
Combined Heuristics for Bi-Level Group Scheduling Problems,
{\em International Journal of Production Economics} 38 (1995) 133-145.

\item Logendran, R., Salmasi, N. and Sriskandarajah, C.:
Two-Machine Group Scheduling Problems in Discrete Parts Manufacturing
with Sequence-Dependent Setups,
{\em Computers and Operations Research} 33 (2006) ???

\item Pan, J.C.-H. and Wu, C.-C.:
Single Machine Group Scheduling to Minimize Mean Flow Time Subject to
Due Date Constraints,
{\em Production Planning and Control} 9 (1998) 366-370.

\item Schaller, J.:
A New Lower Bound for the Flow Shop Group Scheduling Problem,
{\em Computers and Industrial Engineering} 41 (2001) 151-161.

\item Yang, D.-L. and Chern, M.-S.:
Two-Machine Flowshop Group Scheduling Problem,
{\em Computers and Operations Research} 27 (2000) 975-985.

\item Yang, W.-H.:
Group Shceduling in a Two-Stage Flowshop,
{\em Journal of the Operational Research Society} 53 (2002) 1367-1373.

\begin{equation}{\label{h}}\tag{H}\mbox{}\end{equation}

Fuzzy Scheduling Problems.

\item Adamopoulos, G.I. and Pappis, C.P.:
A Fuzzy-Linguistic Approach to a Multi-Criteria Sequencing Problem,
{\em European Journal of Operational Research} 92 (1996) 628-636.

\item Allet, S.:
Handling Flexibility in a “Generalized Job Shop” with a Fuzzy Approach,
{\em European Journal of Operational Research} 147 (2003) 312-333.

\item Bensana, E., Bei, G. and Dubois, D.:
OPAL: A Muli-Knowledge-Based System for Industrial Job-Shop Scheduling,
{\em International Journal of Production Research} 26 (1988) 795-819.

\item Celano, G., Costa, A. and Fichera, S.:
An Evolutionary Algorithm for Pure Fuzzy Flowshop Scheduling Problems,
{\em International Journal of Uncertaint, Fuzziness and Knowledge-Based
Systems} 11 (2003) 655-669.

\item Chanas, S. and Kamburowski, J.:
The Use of Fuzzy Variables in PERT,
{\em Fuzzy Sets and Systems} 5 (1981) 11-19.

\item Chanas, S. and Kasperski, A.:
Minimizing Maximum Lateness in a Single Machine Scheduling Problem with Fuzzy
Processing Times and Fuzzy Due Dates,
{\em Engineering Applications of Artificial Intelligence} 14 (2001) 377-386.

\item Chanas, S. and Kasperski, A.:
On Two Single Machine Scheduling Problems with Fuzzy Processing Times and
Fuzzy Due Dates,
{\em European Journal of Operational Research} 147 (2003) 281-296.

\item Chanas, S. and Kasperski, A.:
Possible and Necessary Optimality of Solutions in the Single Machine
Scheduling Problem with Fuzzy Parameters,
{\em Fuzzy Sets and Systems} 142 (2004) 359-371.

\item Chanas, S. and Zieli\'{n}ski, P.:
On the Sure Criticality of Tasks in Activity Netweorks with Imprecise
Durations,
{\em IEEE Trans. Systems, Man, and Cybernetics — Part B} 32 (2002)
393-407.

\item Cheng, J., Kise, H. and Matsumoto, H.:
A Branch-and Bound Algorithm with Fuzzy Inference for a Permutation Flowshop
Scheduling Problem,
{\em European Journal of Operational Research} 96 (1997) 578-590.

\item Goncalves, J.F., de Magalhaes Mendes, J.J. and Resende, M.G.C.:
A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem,
{\em European Journal of Operational Research} 167 (2005) 77-95.

\item Dubois, D., Fargier, H. and Fortemps, P.:
Fuzzy Scheduling: Modelling Flexible Constraints vs. Coping with Incomplete
Knowledge,
{\em European Journal of Operational Research} 147 (2003) 231-252.

\item Dubois, D., Fargier, H. and Galvagnon, V.:
On Latest Starting Times and Floats in Activity Networks with
Ill-Known Duration,
{\em European Journal of Operational Research} 147 (2003) 266-280.

\item Dubois, D., Fargier, H. and Prade, H.:
Fuzzy Constraints in Job-Shop Scheduling,
{\em Journal of Intelligent Manufacturing} 6 (1995) 215-234.

\item Dumitru, V. and Liban, F.:
Membership Functions, Some Mathematical Programming Models and Production
Scheduling,
{\em Fuzzy Sets and Systems} 8 (1982) 19-33.

\item Fargier, H. and Lamothe, J.:
Handling Soft Constraints in Hoist Scheduling Problems: The Fuzzy Approach,
{\em Engineering Applications of Artificial Intelligence} 14 (2001) 387-399.

\item Fortemps, P.:
Jobshop Scheduling with Imprecise Durations: A Fuzzy Approach,
{\em IEEE Trans. on Fuzzy Systems} 5 (1997) 557-569.

\item Geng, Z.-Q. and Zou, Y.-R.:
Using HGA to solve E/T scheduling problems with fuzzy processing time and
fuzzy due date,
{\em IEEE International Conference on Systems, Man, and Cybernetics}, 2001
pp.1161-1166.

\item Ghrayeb, O.A.:
A Bi-Criteria Optimization: Minimizing the Integral Value and Spread of the
Fuzzy Makespan of Job Shop Scheduling Problems,
{\em Applied Soft Computing} 2/3F (2003) 197-210.

\item Grabot, B. and Geneste, L.:
Dispatching Rules in Scheduling: A Fuzzy Approach,
{\em International Journal of Production Research} 32 (1994) 903-915.

\item Grabot, B. and Geneste, L. and Dupeux, A.:
Multi-Heuristic Scheduling: Three Approaches to Tune Compromises,
{\em Journal of Intelligent Manufacturing} 5 (1994) 303-313.

\item Guiffrida, A.L. and Nagi, R.:
Fuzzy Set Theory Applications in Production Management Research: A
Literature Survey,
{\em Journal of Intelligent Manufacturing} 9 (1998) 39-56.

\item Han, S., Ishii, H. and Fujii, S.:
One Machine Schedluing Problem with Fuzzy Duedates,
{\em European Journal of Operational Research} 79 (1994) 1-12.

\item Hapke, M., Jaszkiewicz, A. and Slowinski, R.:
Fuzzy Project Scheduling System for Software Development,
{\em Fuzzy Sets and Systems} 67 (1994) 101-117.

\item Hapke, M. and Slowinski, R.:
Fuzzy Priority Heuristics for Project Scheduling,
{\em Fuzzy Sets and Systems} 83 (1996) 291-299.

\item Harikrishnan, K.K. and Ishii, H.:
Single Machine Batch Scheduling Problem with Resource Dependent Setup
and Processing Time in the Presence of Fuzzy Due Date,
{\em Fuzzy Optimization and Decision Making} 4 (2005) 141-147.

\item Hintz, G.W. and Zimmermann, H.-J.:
A Method to Control Flexible Manufacturing Systems,
{\em European Journal of Operational Research} 41 (1989) 321-334.

\item Hong, T.-P. and Chuang, T.-N.:
Fuzzy Scheduling on Two-Machine Flow Shop,
{\em Journal of Intelligent and Fuzzy Systems} 6 (1998) 471-481.

\item Hong, T.-P. and Chuang, T.-N.:
Fuzzy CDS Scheduling for Flow Shops with More Than Two Machines,
{\em Journal of Intelligent and Fuzzy Systems} 6 (1998) 483-494.

\item Hong, T.-P. and Chuang, T.-N.:
Fuzzy Palmer Scheduling for Flow Shops with More Than Two Machines,
{\em Journal of Information Science and Engineering} 15 (1999) 397-406.

\item Hong, T.-P. and Chuang, T.-N.:
A New Triangular Fuzzy Johnson Algorithm,
{\em Computers and Industrial Engineering} 36 (1999) 179-200.

\item Hong, T.-P., Huang, C.-M. and Yu, K.-M.:
LPT Scheduling for Fuzzy Task,
{\em Fuzzy Sets and Systems} 97 (1998) 277-286.

\item Ishibuchi, H., Murata, T. and Lee, K.-H.:
Formulation of Fuzzy Flowshop Scheduling Problems with Fuzzy Processing Time, Proceedings of the 5th IEEE International Conference on Fuzzy
Systems, 1996, pp.199-205.

\item Ishibuchi, H., Murata, T. and Lee, K.-H.:
Relations between conventional scheduling problems and fuzzy scheduling problems,
{\em Proceedings of the 35th IEEE Decision and Control}, 1996, pp.106-107.

\item Ishibuchi, H., Yamamoto, N., Misaki, S. and Tanaka, H.:
Local Search Algorithms for Flow Shop Scheduling with Fuzzy Due-Dates,
{\em International Journal of Production Economics} 33 (1994) 53-66.

\item Ishibuchi, H., Yamamoto, N., Murata, T. and Tanaka, H.:
Genetic Algorithms and Neighborhood Search Algorithms for Fuzzy Flowshop Scheduling Problems,
{\em Fuzzy Sets and Systems} 67 (1994) 81-100.

\item Ishii, H. and Tada, M.:
Single Machine Scheduling Problem with Fuzzy Precedence Relation,
{\em European Jornal of Operational Research} 87 (1995) 284-288.

\item Ishii, H., Tada, M. and Masuda, T.:
Two Scheduling Problems with Fuzzy Due-Dates,
{\em Fuzzy Sets and Systems} 46 (1992) 339-347.

\item Itoh, T. and Ishii, H.:
Fuzzy Due-Date Scheduling Problem with Fuzzy Processing Time,
{\em International Transactions in Operational Research} 6 (1999) 639-647.

\item Itoh, T. and Ishii, H.:
One Machine Scheduling Problem with Fuzzy Ranom Due-Dates,
{\em Fuzzy Optimization and Decision Making} 4 (2005) 71-78.

\item Kim. K.W., Gen, M. and Yamazaki, G.:
Hybrid Genetic Algorithm with Fuzzy Logic for Resource-Constrained
Project Scheduling,
{\em Applied Soft Computing} 2/3F (2003) 174-188.

\item Kuroda, M. and Wang, Z.:
Fuzzy Job Shop Scheduling,
{\em International Journal of Prouction Economics} 44 (1996) 45-51.

\item Lam, S.S. and Cai, X.:
Early-tardy scheduling under fuzzy due dates using a genetic algorithm,
{\em IEEE Proceedings of the 1999 Congress on Evolutionary Computation},
1999, pp.?

\item Lam, S.S. and Cai, X.:
Single Machine Scheduling with Nonlinear Lateness Cost Functions and Fuzzy
Due Dates,
{\em Nonlinear Analysis: Real World Applications} 3 (2002) 307-316.

\item Li, J. and Kwan, R.S.K.:
A Fuzzy Genetic Algorithm for Driver Scheduling,
{\em European Journal of Operational Research} 147 (2003) 334-344.

\item Li, Y., Luh, P.B. and Guan, X.:
Fuzzy Optimization-Based Scheduling of Identical Machines with Possible
Breakdown,
{\em IEEE International Conference on Robotics and Automation}, 1994,
3447-3452.

\item Litoiu, M. and Tadei, R.:
Real Time Task Scheduling Allowing Fuzzy Due Dates,
{\em European Journal of Operational Research} 100 (1997) 475-481.

\item Litoiu, M. and Tadei, R.:
Real-Time Task Scheduling with Fuzzy Deadlines and Processing Times,
{\em Fuzzy Sets and Systems} 117 (2001) 35-45.

\item Lootsma, F.A.:
Stochastic and Fuzzy Pert,
{\em European Journal of Operational Research} 43 (1989) 174-183.

\item McCahon, C.S.:
Using PERT as an Approximation of Fuzzy Project-Network Analysis,
{\em IEEE Trans. on Engineering Management} 40 (1993) 146-153.

\item McCahon, C.S. and Lee, E.S.:
Project Network Analysis with Fuzzy Activity Times,
{\em Computers and Mathematics with Applications} 15 (1988) 829-838.

\item McCahon, C.S. and Lee, E.S.:
Job Scheduling with Fuzzy Processing Times,
{\em Computers and Mathematics with Applications} 19 (1990) 31-41.

\item McCahon, C.S. and Lee, E.S.:
Fuzzy Job Sequencing for a Flow Shop,
{\em European Journal of Operational Research} 62 (1992) 294-301.

\item Murata, T., Gen, M. and Ishibuchi, H.:
Multiobjective Scheduling with Fuzzy Due Date,
{\em Computers and Industrial Engineering} 35 (1998) 439-442.

\item Murata, T., Ishibuchi, H. and Lee, K.-H.:
Reformulation of various non-fuzzy scheduling problems using the concept of
fuzzy due-date,
{\em Proceedings of the Sixth IEEE International Conference on Fuzzy
Systems}, 1997, pp.447-452.

\item Muthusamy, K., Sung, S.C., Vlach, M. and Ishii, H.:
Scheduling with Fuzzy Delays and Fuzzy Precedences,
{\em Fuzzy Sets and Systems} 134 (2003) 387-395.

\item Nasution, S.H.:
Fuzzy Critical Path Method,
{\em IEEE Trans. on Systems, Man, and Cybernetics} 24 (1994) 48-57.

\item \”{O}zelkan, E.C. and Duckstein, L.:
Optimal Fuzzy Counterparts of Scheduling Rules,
{\em European Jornal of Operational Research} 113 (1999) 593-609.

\item Pappis, C.P. and Karacapilidis, N.I.:
Lot Size Scheduling Using Fuzzy Numbers,
{\em International Transactions in Operational Research} 2 (1995) 205-212.

\item Prade, H.:
Using Fuzzy Set Theory in a Scheduling Problem: A Case Study,
{\em Fuzzy Sets and Systems} 2 (1979) 153-165.

\item Rommelfanger, H.J.:
Network Analysis and Information Flow in Fuzzy Environment,
{\em Fuzzy Sets and Systems} 67 (1994) 119-128.

\item Roy, U. and Zhang, X.:
A Heuristic Approach to n/m Job Shop Scheduling: Fuzzy Dynamic Scheduling
Algorithms,
{\em Production Planning and Control} 7 (1996) 299-311.

\item Sakawa, M. and Kubota, R.:
Fuzzy Programming for Multiobjective Job Shop Scheduling with Fuzzy
Processing Time and Fuzzy Duedate through Genetic Algorithms,
{\em European Journal of Operational Research} 120 (2000) 393-407.

\item Sakawa, M., Kato, K. and Mori, T.:
Flexible Scheduling in a Machininh Center through Genetic Algorithms,
{\em Computers and Industrial Engineering} 30 (1996) 931-940.

\item Sakawa, M. and Mori, T.:
An Efficient Genetic Algorithm for Job-Shop Scheduling Problems with
Fuzzy Processing Time and Fuzzy Duedate,
{\em Computers and Industrial Engineering} 36 (1999) 325-341.

\item Slany, W.:
Scheduling as a Fuzzy Multiple Criteria Optimization Problem,
{\em Fuzzy Sets and Systems} 78 (1996) 197-222.

\item Slyeptsov, A.I. and Tyshchuk, T.A.:
Fuzzy Temporal Characteristics of Operations for Project Management on the
Network Models Basis,
{\em European Journal of Operational Research} 147 (2003) 253-265.

\item Stanfield, P.M., King, R.E. and Joines, J.A.:
Scheduling Arrivals to a Production System in a Fuzzy Environment,
{\em European Journal of Operational Research} 93 (1996) 75-87.

\item Sung, S.C. and Vlach, M.:
Single Machine Scheduling to Minimize the Number of Late Jobs under
Uncertainty,
{\em Fuzzy Sets and Systems} 139 (2003) 421-430.

\item Temiz, I. and Erol, S.:
Fuzzy Branch-and-Bound Algorithm for Flow Shop Scheduling,
{\em Journal of Intelligent Manufacturing} 15 (2004) 449-454.

\item Tsujimura, Y., Park, S.H., Chang, S. and Gen, M.:
An Efficient Method for Solving Flow Shop Scheduling Problem with Fuzzy
Processing Times,
{\em Computers and Industrial Engineering} 25 (1993) 239-242.

\item Turksen, I.B., Ulguray, D. and Wang, Q.:
Hierarchical Scheduling Based on Approximate Reasoning — A Comparison
with ISIS,
{\em Fuzzy Sets and Systems} 46 (1992) 349-371.

\item T\”{u}rksen, I.B. and Zarandi, M.H.F.:
Fuzzy System Models for Aggregate Scheduling Analysis,
{\em International Journal of Approximate Reasoning} 19 (1998) 119-143.

\item Wang, C., Wang, D., Ip, W.H. and Yuen, D.W.:
The Single Machine Ready Time Scheduling Problem with Fuzzy Processing Times,
{\em Fuzzy Sets and Systems} 127 (2002) 117-129.

\item Wang, H.-F. and Fu, C.-C.:
Fuzzy Project Scheduling Models under Inflation Condition,
{\em International Journal of Uncertainty, Fuzziness and Knowledge-Based
Systems} 4 (1996) 497-514.

\item Wang, J.:
A Fuzzy Robust Scheduling Approach for Product Development Projects,
{\em European Journal of Operational Research} 152 (2004) 180-194.

\item Wu, C. and Gu, X.:
A Genetic Algorithm for Flow Shop Scheduling with Fuzzy Processing Time
and Due Date,
{\em Proceedings of the 5th IEEE World Congress on Intelligent Control and
Automation} 2004, pp.2938-2942.

\item Yan, H. and Luh, P.B.:
A Fuzzy Optimization-Based Method for Integrated Power System Scheduling
and Inter-Utility Power Transaction with Uncertainties,
{\em IEEE Trans. on Power Systems} 12 (1997) 756-763.

\item Zheng, L. and Gu, X.:
Fuzzy Production Scheduling in No-Wait Flow Shop to Minimize the Makespan
with E/T Constraints Using SA,
{\em Proceedings of the 5th IEEE World Congress on Intelligent Control and
Automation} 2004, pp.15-19.

\begin{equation}{\label{i}}\tag{I}\mbox{}\end{equation}

Using Genetic Algorithm.

\item Abboud, N., Inuiguchi, M., Sakawa, M. and Uemura, Y.:
Manpower Allocation Using Genetic Annealing,
{\em European Journal of Operational Research} 111 (1998) 405-420.

\item Armentano, V.A. and Mazzini, R.:
A Genetic Algorithm for Scheduling on a Single Machine with Set-Up Times
and Due Dates,
{\em Production Planning and Control} 11 (2000) 713-720.

\item Arroyo, J.E.C. and Armentano, V.A.:
Genetic Local Search for Multiobjective Flowshop Scheduling Problems,
{\em European Journal of Operational Research} 167 (2005) 717-738.

\item Bean, J.C.:
Genetic Algorithms and Random Keys for Sequencing and Optimization,
{\em ORSA Journal on Computing} 6 (1994) 154-160.

\item Bierwirth, C. and Mattfeld, D.C.:
Production Scheduling and Rescheduling with Genetic Algorithms,
{\em Evolutional Computation} 7 (1999) 1-17.

\item Cai, X. and Li, K.N.:
A Genetic Algorithm for Scheduling Staff of Mixed Skills under Multi-Criteria,
{\em European Journal of Operational Research} 125 (2000) 359-369.

\item Caraffa, V., Ianes, S., Bagchi, T.P. and Sriskandarajah, C.:
Minimizing Makespan in a Blocking Flowshop Using Genetic Algorithms,
{\em International Journal of Production Economics} 70 (2001) 101-115.

\item Cavory, G., Dupas, R. and Goncalves, G.:
A Genetic Approach to Solving the Problem of Cyclic Job Shop Scheduling
with Linear Constraints,
{\em European Journal of Operational Research} 161 (2005) 73-85.

\item Chen, C.-L., Neppalli, R.V. and Aljaber, N.:
Genetic Algorithms Applied to the Continuous Flow Shop Problem,
{\em Computers and Industrial Engineering} 30 (1996) 919-929.

\item Chen, C.-L., Vempati, V.S. and Aljaber, N.:
An Application of Genetic Algorithm for Flow Shop Problems,
{\em European Journal of Operational Research} 80 (1995) 389-396.

\item Cheng, R., Gen, M. and Tsujimura, Y.:
A Tutorial Survey of Job-Shop Scheduling Problems Using Genetic Algorithms I. Representation,
{\em Computers and Industrial Engineering} 30 (1996) 983-997.

\item Cheung, W. and Zhou, H.:
Using Genetic Algorithms amd Heuristics for Job Shop Scheduling with Sequence-Dependent Steup Times,
{\em Annals of Operations Research} 107 (2001) 65-81.

\item Croce, F.D., Tadei, R. and Volta, G.:
A Genetic Algorithm for the Job Shop Problem,
{\em Computers and Operations Research} 22 (1995) 15-24.

\item Dahal, K.P., Aldridge, C.J. and McDonald, J.R.:
Generator Maintenance Scheduling Using a Genetic Algorithm,
{\em Fuzzy Sets and Systems} 102 (1999) 21-29.

\item Dorndorf, U. and Pesch, E.:
Evolution Based Learning in a Job Shop Scheduling Environment,
{\em Computers and Operations Research} 22 (1995) 25-40.

\item Dussa-Zieger, K. and Schwehm, M.:
Scheduling of Parallel Programs on Configurable Multiprocessors by Genetic Algorithms,
{\em International Journal of Approximate Reasoning} 19 (1998) 23-38.

\item Essafi, I., Mati, Y. and Dauz\'{e}re-P\'{e}r\'{e}s, S.:
A Genetic Local Search Algorithm for Minimizing Total Weighted Tardiness in the Job-Shop Scheduling Problem,
{\em Computers and Operations Research} 35 (2008) 2599-2616.

\item Falkenauer, E. and Bouffouix, S.:
A Genetic Algorithm for Job Shop,
{\em Proceedings of the IEEE International Conference on Robotics and
Automation}, pp.824-829, 1991.

\item Fanti, M.P., Maione, B., Naso, D. and Turchiano, B.:
Genetic Multicriteria Approach to Flexible Line Scheduling,
{\em International Journal of Approximate Reasoning} 19 (1998) 5-21.

\item Gupta, M.C., Gupta, Y.P. and Kumar, A.:
Minimizing Flow Time Variance in a Single Machine System Using Genetic Algorithm,
{\em European Journal of Operational Research} 70 (1993) 289-303.

\item Holsapple, C.W., Jacob, V.S., Pakath, R. and Zaveri, J.S.:
A Genetic-Based Hybrid Schedule for Generating Static Schedules in Flexible Manufacturing Contexts,
{\em IEEE Trans. on Systemsn, Man, and Cybernetics} 23 (1993) 953-972.

\item Hou, E.S.H., Ansari, N. and Ren, H.:
A Genetic Algorithm for Multiprocessor Scheduling,
{\em IEEE Trans. on Parallel and Distributed Systems} 5 (1994) 113-120.

\item Ishibuchi, H, and Murata, T.:
A Multi-Objective Genetic Local Search Algorithm and Its Application to
Flowshop Scheduling,
{\em IEEE Trans. on Systemsn, Man, and Cybernetics} 28 (1998) 392-403.

\item Ishibuchi, H., Yoshida, T. and Murata, T.:
Balance between Genetic Search and Local Search in Memetic Algorithms
for Multiobjective Permutation Flowshop Scheduling,
{\em IEEE Trans. on Evolutionary Computation} 7 (2003) 204-223.

\item Janiak, A. and Portmann, M.-C.:
Genetic Algorithm for the Permutation Flow-Shop Scheduling Problem
with Linear Models of Operations,
{\em Annals of Operations Research} 83 (1998) 95-114.

\item Kobayashi, S., Ono, I. and Yamamura, M.:
An Efficient Genetic Algorithm for Job SHop Scheduling Problems,
in the Proceedings of the Sixth International Conference on Genetic
Algorithms, 1995, pp. 506-511.

\item K\”{o}ksalan, M. and Keha, A.B.:
Using Genetic Algorithms for Single-Machine Bicriteria Scheduling Problems,
{\em European Journal of Operational Research} 145 (2003) 543-556.

\item Lee, C.-Y. and Kim, S.J.:
Parallel Genetic Algorithms for the Earliness-Tardiness Job Scheduling Problem with General Penalty Weights
{\em Computers and Industrial Engineering} 28 (1995) 231-243.

\item Liaw, C.-F.:
A Hybrid Genetic Algorithm for the Open Shop Scheduling Problem,
{\em European Journal of Operational Research} 124 (2000) 28-42.

\item Mattfeld, D.C. and Bierwirth, C.:
An Efficient Genetic Algorithm for Job Shop Scheduling with Tardiness
Objectives,
{\em European Journal of Operational Research} 155 (2004) 616-630.

\item Miller, D.M., Chen, H.-C., Matson, J. and Liu, Q.:
A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem,
{\em Journal of Heuristics} 5 (1999) 437-454.

\item Murata, T., Ishibuchi, H. and Tanaka, H.:
Multi-Objective Genetic Algorithm and Its Applications to Flowshop
Scheduling,
{\em Computers and Industrial Engineering} 30 (1996) 957-968.

\item Murata, T., Ishibuchi, H. and Tanaka, H.:
Genetic Algorithms for Flowshop Scheduling Problems,
{\em Computers and Industrial Engineering} 30 (1996) 1061-1071.

\item Nagano, M.S., Ruiz, R., Antonio, L. and Lorena, N.:
A Constructive Genetic Algorithm for Permutation Flowshop Scheduling,
{\em Computers and Industrial Engineering} 55 (2008) 195-207.

\item Neppalli, V.R., Chen, C.-L. and Gupta, J.N.D.:
Genetic Algorithms for the Two-Stage Bicriteria Flowshop Problem,
{\em European Journal of Operational Research} 95 (1996) 356-373.

\item Onwubolu, G. and Davendra, D.:
Scheduling Flow Shops Using Diffrerential Evolution Algorithm,
{\em European Journal of Operational Research} 171 (2006) 674-692.

\item Pezzela, F., Morganti, G. and Ciaschetti, G.:
A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem,
{\em Computers and Operations Research} 35 (2008) 3202-3212.

\item Pongcharoen, P., Hicks, C. and Braiden, P.M.:
The Development of Genetic Algorithms for the Finite Capacity Scheduling
of Complex Products, with Multiple Levels of Product Structure,
{\em European Journal of Operational Research} 152 (2004) 215-225.

\item Prins, C.:
Competitive Genetic Algorithms for the Open-Shop Scheduling Problem,
{\em Mathematical Methods of Operations Research} 52 (2000) 389-411.

\item Reeves, C.R.:
A Genetic Algorithm for Flowshop Sequencing,
{\em Computers and Operations Research} 22 (1995) 5-13.

\item Reeves, C.R. and Yamada, T.:
Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem,
{\em Evolutionary Computation} 6 (1998) 45-60.

\item Roach, A. and Nagi, R.:
A Hybrid GA-SA Algorithm for Just-In-Time Scheduling of Multi-level
Assemblies,
{\em Computers and Industrial Engineering} 30 (1996) 1047-1060.

\item Rubin, P.A. and Ragatz, G.L.:
Scheduling in a Sequence Dependent Steup Environment with Genetic Search,
{\em Computers and Operations Research} 22 (1995) 85-99.

\item Ruiz, R., Maroto, C. and Alcaraz, J.:
Two New Robust Genetic Algorithms for the Flowshop Scheduling Problem,
{\em Omega} 34 (2006) 461-476.

\item Sakawa, M., Kato, K. and Mori, T.:
Flexible Scheduling in a Machininh Center through Genetic Algorithms,
{\em Computers and Industrial Engineering} 30 (1996) 931-940.

\item Sakawa, M. and Mori, T.:
An Efficient Genetic Algorithm for Job-Shop Scheduling Problems with Fuzzy Processing Time and Fuzzy Duedate,
{\em Computers and Industrial Engineering} 36 (1999) 325-341.

\item Sikora, R.:
A Genetic Algorithms for Integrating Lot-Sizing and Sequencing in Scheduling A Capacitated Flow Line,
{\em Computers and Industrial Engineering} 30 (1996)969-981.

\item Speras, W.M. and DeJong, K.A.:
On the Virtues of Parameterized Uniform Crossover, in
{\em Proceedings of the Fourth International Conference Genetic Algorithms}, pp.230-236, 1991.

\item Tamaki, H. and Nishikawa, Y.:
A Parallel Genetic Algorithm Based on a Neighborhood Model and Its Application to the Jobshop Scheduling,
{\em Parallel Problem Solving from Nature} 2 (1992) 573-582.

\item Tseng, L.-Y. and Lin, Y.-T.: ()
A Hybrid Genetic Local Search Algorithm for the Permutation Flowshop Scheduling Problem,
{\em European Journal of Operational Research} 198 (2009) 84-92.

\item Varela, R., Vela, C.R., Puente, J. and Gomez, A.:
A Knowledge-Based Evolutionary Strategy for Scheduling Problems with Bottlenecks,
{\em European Journal of Operational Research} 145 (2003) 57-71.

\item Wang, C.-S. and Uzsoy, R.:
A Genetic Algorithm to Minimize Maximum Lateness on a Batch Processing Machine,
{\em Computers and Operations Research} 29 (2002) 1621-1640.

\item Wang, L., Zhang, L. and Zheng, D.-Z.:
An Efficient Hybrid Genetic Algorithm for Flow Shop Scheduling with Limited Buffers,
{\em Computers and Operations Research} 33 (2006) 2960-2971.

\item Wren, A. and Wren, D.O.:
A Genetic Algorithm for Public Transport Driven Scheduling,
{\em Computers and Operations Research} 22 (1995) 101-110.

\item Yamada, T. and Nakano, R.:
A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems,
{\em Parallel Problem Solving from Nature} 2 (1992) 281-290.
(Genetic Algorithm in Scheduling)
The Hybrid Heuristic Genetic Algorithm for Job Shop Scheduling,
{\em Computers and Industrial Engineering} 40 (2001) 191-200.

\begin{equation}{\label{j}}\tag{J}\mbox{}\end{equation}

Using Ant Colony Optimization.

\item Blum, C.:
Beam-ACO — Hybridizing Ant Colony Optimization with Beam Search:
An Application to Open Shop Scheduling,
{\em Computers and OPerations Research} 32 (2005) 1565-1591.

\item Gajpal, Y. and Rajendran, C.:
An Ant-Colony Optimization Algorithm for Minimizing the Completion-Time
Variance of Jobs in Flowshops,
{\em International Journal of Production Economics} 101 (2006) 259-272.

\item Gagn\'{e}, C., Price, W.L. and Gravel, M.:
Comparing an ACO Algorithm with Other Heuristics for the Single Machine
Scheduling Problem with Sequence-Dependent Setup Times,
{\em Journal of Operational Research Society} 53 (2002) 895-906.

\item Gambardella, L.M. and Dorigo, M.:
An Ant Colony System Hybridized with a New Local Search for the Sequential
Ordering Problem,
{\em INFORMS Journal on Computing} 12 (2000) 237-255.

\item Huang, K.-L. and Liao, C.-J.:
Ant Colony Optimization Combined with Taboo Search for the Job
Shop Scheduling Problem,
{\em Computers and Operations Research} 35 (2008) 1030-1046.

\item Liao, C.-J. and Juan, H.-C.:
An Colony Optimization for Single-Machine Tardiness Scheduling with
Sequence-Dependent Setups,
{\em Computers and Operations Research} 34 (2007) 1899-1909.

\item Lin, B.M.T., Lu, C.Y., Shyu, S.J. and Tsai, C.Y.:
Development of New Features of Ant Colony Optimization for
Flowshop Scheduling,
{\em International Journal of Production Economics} 112 (2008) 742-755.

\item Merkle, D. and Middendorf, M.:
Ant Colony Optimization with Global Pheromone Evaluation for Scheduling
a Single Machine,
{\em Applied Intelligence} 18 (2003) 105-111.

\item Merkle, D. and Middendorf, M.:
On Solving Permutation Scheduling Problems with Ant Colony Optimization,
{\em International Journal of Systems Science} 36 (2005) 255-266.

\item Merkle, D., Middendorf, M. and Schmeck, H.:
Ant Colony Optimization for Resource-Constrained Project Scheduling,
{\em IEEE Trans. on Evolutionary Computation} 6 (2002) 333-346.

\item Rajendran, C. and Ziegler, H.:
Scheduling to Minimize teh Sum of Weighted Flowtime and Weighted Tardiness of
Jobs in a Flowshop with Sequence-Dependent Setup Times,
{\em European Journal of Operational Research} 149 (2003) 513-522.

\item Rajendran, C. and Ziegler, H.:
Two Ant-Colony Algorithms for Minimizing Total Flowtime in Permutation
Flowshops,
{\em Computers and Operations Research} 48 (2005) 789-797.

\item Shyu, S.J., Lin, B.M.T. and Yin, P.Y.:
Application of Ant Colony Optimization for No-Wait Flowshop Scheduling
Problem to minimize the Total Completion Time,
{\em Computers and Operations Research} 47 (2004) 181-193.

\item Tkindt, V., Monmarch\'{e}, N., Tercinet, F. and La\”{u}gt, D.:
An Ant Colony Optimization Algorithm to Solve a $2$-Machine Bicriteria
Flowshop Scheduling Problem,
{\em European Journal of Operational Research} 142 (2002) 250-257.

\item Tseng, L.-Y. and Chen, S.-C.:
A Hybrid Metaheuristic for the Resource-Constrained Project Scheduling Problem,
{\em European Journal of Operational Research} 175 (2006) 707-721.

\item Yagmahan, B. and Yenisey, M.M.:
Ant Colony Optimization for Multi-Objective Flow Shop Scheduling Problem,
{\em Computers and Industrial Engineering} 54 (2008) 411-420.

\item Ying, K.-C. and Liao, C.-J.:
An ant Colony System for Permutation Flow-Shop Sequencing,
{\em Computers and Operations Research} 31 (2004) 791-801.

\begin{equation}{\label{k}}\tag{K}\mbox{}\end{equation}

Using Artificial Immune System.

\item Costa, A.M., Vargas, P.A., Von Zuben, F.J. and Franca, P.M.:
Makespan minimization on parallel processors: an immune-based approach,
Proceedings of the IEEE Congress on Evolutionary Computation, 2002, pp.920 – 925.

\item Engin, O. and D\”{o}yen, A.:
A New Approach to Solve Hybrid Flow Shop Scheduling Problems by Artificial Immune System,
{\em Future Generation and Computer Systems} 20 (2004) 1083-1-95.

\item Hart, E., Ross, P. and Nelson, J.:
Producing robust schedules via an artificial immune system,
Proceedings of the IEEE Conference on Evolutionary Computation, 1998, pp.464-469.

\item Zandieh, M., Ghomi, S.M.T.F. and Husseini, S.M.M.:
An Immune Algorithm Approach to Hybrid Flow Shops Scheduling with
Sequence-Dependent Setup Times,
{\em Applied Mathematics and Computation} 180 (2006) 111-127.

\begin{equation}{\label{l}}\tag{L}\mbox{}\end{equation}

Using Branch and Bound.

\item Barker, J.R. and McMathon, G.B.:
Scheduling the General Job-Shop,
{\em Management Science} 31 (1985) 594-598.

\item Brucker, P., Hurink, J., Jurisch, B. and W\”{o}stmann, B.:
A Branch-and-Bound Algorithm for the Open-Shop Problem,
{\em Discrete Applied Mathematics} 76 (1997) 43-59.

\item Carlier, J. and Pinson, E.:
An Algorithm for Solving the Job-Shop Problem,
{\em Management Science} 35 (1989) 164-176.

\item Carlier, J. and Rebai, I.:
Two Branch and Bound Algorithms for the Permutation Flow Shop Problem,
{\em European Journal of Operational Research} 90 (1996) 238-251.

\item Croce, F.D., Narayan, V. and Tadei, R.:
The Two-Machine Total Completion Time Flow Shop Problem,
{\em European Journal of Operational Research} 90 (1996) 227-237.

\item Gu\'{e}ret, C. and Prins, C.:
A New Lower Bound for the Open-Shop Problem,
{\em Annals of Operations Research} 92 (1999) 165-183.

\item Ignall, E. and Schrage, L.:
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems,
{\em Operations Research} 13 (1965) 400-412.

\item Nagar, A., Heragu, S.S. and Haddock, J.:
A Branch-and-Bound Approach for a Two-Machine Flowshop Scheduling Problem,
{\em Journal of the Operational Research Society} 46 (1995) 721-734.

\item Yeh, W.-C.:
A New Branch-and-Bound Approach fpr the $n/2/flowshop/\alpha F+\beta C_{\max}$ Flowshop Scheduling Problem,
{\em Computers and Operations Research} 26 (1999) 1293-1310.

\item Yeh, W.-C.:
An Efficient Branch-and-Bound Algorithm for the Two-Machine Bicriteria Flowshop Scheduling Problem,
{\em Journal of Manufacturing Systems} 20 (2001) 113-123.

\begin{equation}{\label{m}}\tag{M}\mbox{}\end{equation}

Using Simulated Annealing.

\item Andresen, M., Br\”{a}sel, H., M\”{o}rig, M., Tusch, J., Werner, F. and Willenius, P.:
Simulated Annealing and Genetic Algorithms for Minimizing Mean Flow Time in an Open Shop,
{\em Mathematical and Computer Modelling} 48 (2008) 1279-1293.

\item Ben-Daya, M. and Al-Fawzan, M.:
A Simulated Annealing Approach for the One-Machine Mean Tardiness Scheduling
Problem,
{\em European Journal of Operational Research} 93 (1996) 61-67.

\item He, Z., Yang, T. and Tiger, A.:
An Exchange Heuristic Imbedded with Simulated Annealing for Due-Dates
Job-Shop Scheduling,
{\em European Journal of Operational Research} 91 (1996) 99-117.

\item Ishibuchi, H., Misaki, S. and Tanaka, H.:
Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem,
{\em European Journal of Operational Research} 81 (1995) 388-398.

\item Kolonko, M.:
Some New Results on Simulated Annealing Applied to the Job Shop Scheduling
Problem,
{\em European Journal of Operational Research} 113 (1999) 123-136.

\item Lee, W.-C., Wu, C.-C. and Chen, P.:
A Simulated Annealing Approach to Makespan Minimization on Identical
Parellel Machines,
{\em International Journal of Advanced Manufacturing Technology}
31 (2006) 328-334.

\item Lin, C.K.Y., Haley, K.B. and Sparks, C.:
A Comparative Study of Both Standard and Adaptive Versions of Threshold
Accepting and Simulated Annealing Algorithms in Three Scheduling Problems,
{\em European Journal of Operational Research} 83 (1995) 330-346.

\item Ogbu, F.A. and Smith, D.K.:
Simulated Annealing for the Permutation Flowshop Problem,
{\em OMEGA} 19 (1990) 64-67.

\item Osman, I.H. and Potts, C.N.:
Simulated Annealing for Permutation Flow-Shop Scheduling,
{\em OMEGA} 17 (1989) 551-557.

\item Sadeh, N.M., Nakskuki, Y. and Thangiah, S.R.:
Learning to Recognize (Un)promising Simulated Annealing Runs:
Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing,
{\em Annals of Operations Research} 75 (1997) 189-208.

\item Tan, K.C. and Narasimhan, R.:
Minimizing Tardiness on a Single Processor with Sequence-Dependent
Setup Times: A Simulated Annealing Approach,
{\em Omega} 25 (1997) 619-634.

\item Van Laarhoven, P.J.M., Aarts, E.H.L. and Lenstra, J.K.:
Job Shop Scheduling by Simulated Annealing,
{\em Operations Research} 40 (1992) 113-125.

\item Varadharajan, T.K. and Rajendran, C.:
A Multiobjective Simulated Annealing Algorithm for Scheduling in Flowshops
to Minimize the Makespan and Total Flowtime of Jobs,
{\em European Journal of Operational Research} 167 (2005) 772-795.

\item Wang, L. and Zheng, D.-Z.:
An Effective Hybrid Optimization Strategy for Job-Shop Scheduling Problems,
{\em Computers and Operations Research} 28 (2001) 585-596.

\item Xia, W., Wu, Z., Zhang, W. and Yang, G.:
A new hybrid optimization algorithm for the job-shop scheduling problem,
Proceedings of the American Control Conference, 2004, pp.5552-5557.

\item Zegordi, S.H., Ioth, K. and Enkawa, T.:
Minimizing Makespan for Flow Shop Scheduling by Combining Simulated
Annealing with Sequencing Knowledge,
{\em European Journal of Operational Research} 85 (1995) 515-531.

\begin{equation}{\label{n}}\tag{N}\mbox{}\end{equation}

Using Tabu Search.

\item Armentano, V.A. and Arroyo, J.C.:
An Application of a Multiobjective Tabu Search Algorithm to a Bicriteria
Flowshop Problem,
{\em Journal of Heuristics} 10 (2004) 463-481.

\item Ben-Daya, M. and Al-Fawzan, M.: ()
A Tabu Search Approach for the Flow Shop Scheduling Problem,
{\em European Journal of Operational Research} 109 (1998) 88-95.

\item Dauzere-Peres, S. and Paulli, J.:
An Integrated Approach for Modelling and Solving the General Multiprocessor
Job-Shop Scheduling Problem Using Tabu Search,
{\em Annals of Operations Research} 70 (1997) 281-306.

\item Dell’Amico, M. and Trubian, M.:
Applying Tabu Search to the Job-Shop Scheduling Problem,
{\em Annals of Operations Research} 41 (1993) 231-252.

\item Eksio\v{g}lu, B., Eksio\{v}glu, S.D. and Jain, P.:
A Tabu Search Algorithm for the Flowshop Scheduling Problem
with Changing Neighborhoods,
{\em Computers and Industrial Engineering} 54 (2008) 1-11.

\item Hao, Q., Yang, Z., Wang, D. and Li, Z.:
Common Due Date Determination and Sequencing Using Tabu Search,
{\em Compuetrs and Operations Research} 23 (1996) 409-417.

\item James, R.J.W. and Buchanan, J.T.:
Performance Enhancements to Tabu Search for the Early/Tardy Scheduling
Problem,
{\em European Journal of Operational Research} 106 (1998) 254-265.

\item J\'{o}zefowska, J., Walig\'{o}ra, G. and Weglarz, J.:
Tabu List Management Methods for a Discrete-Continuous Scheduling Problem,
{\em European Journal of Operational Research} 137 (2002) 288-302.

\item Karasakal, E.K. and K\”{o}ksalan, M.:
A Simulated Annealing Approach to Bicriteria Scheduling Problems on a
Single Machine,
{\em Journal of Heuristics} 6 (2000) 311-327.

\item Laguna, M. and Glover, F.:
Integrating Target Analysis and Tabu Search for Improved Scheduling Systems,
{\em Expert Systems with Applications} 6 (1993) 287-297.

\item Mooney, E.L. and Rardin, R.L.:
Tabu Search for a Class of Scheduling Problems,
{\em Annals of Operations Research} 41 (1993) 253-278.

\item Nowicki, E. and Smutnicki,, C.:
A Fast Taboo Search Algorithm for the Job Shop Problem,
{\em Management Science} 42 (1996) 797-813.

\item Nowicki, E. and Smutnicki,, C.:
An Advanced Tabu Search Algorithms for the Job Shop Problem,
{\em Journal of Scheduling} 8 (2005) 145-159.

\item Valls, V., Perez, M.A. and Quintanilla, M.S.:
A Tabu Search Approach to Machine Scheduling,
{\em European Journal of Operational Research} 106 (1998) 277-300.

\item Wan, G., Yen, B. P.-C.:
Tabu Search for Single Machine Scheduling with Distinct Due Windows and
Weighted Earliness/Tardiness Penalties,
{\em European Journal of Operational Research} 142 (2002) 271-281.

\item Wang, L. and Zheng, D.-Z.:
An Effective Hybrid Optimization Strategy for Job-Shop Scheduling Problems,
{\em Computers and Operations Research} 28 (2001) 585-596.

\item Pezzella, F. and Merelli, E.:
A Tabu Search Method Guided by Shifting Bottleneck for the Job Shop
Scheduling Problem,
{\em European Journal of Operational Research} 120 (2000) 297-310.

\item Zhang, C.Y., Li, P.G., Guan, Z.L. and Rao, Y.Q.:
A Tabu Search Algorithm with a New Neighborhood Structure for the Job
Shop Scheduling Problem,
{\em Computers and Operations Research} 34 (2007) 3229-3242.

\begin{equation}{\label{o}}\tag{O}\mbox{}\end{equation}

Using Heuristic Algorithms.

\item Adams, J., Balas, E. and Zawack, D.:
The Shifting Bottleneck Procedure for Job Shop Scheduling,
{\em Management Science} 34 (1988) 391-401.

\item Brucker, P., Hurink, J. and Werner, F.:
Improving Local Search Heuristics for Some Scheduling Problems — I,
{\em Discrete Applied Mathematics} 65 (1996) 97-122.

\item Campbell, H.G., Dudek, R.A. and Smith, M.L.:
A Heuristic Algorithm for the $n$ Job, $m$ Machine Sequencing Problem,
{\em Management Science} 16 (1970) B630-B637.

\item Cheng, T.C.E.:
A Heuristic for Common Due-Date Asignment and Job Scheduling on Paralle
Machines,
{\em Journal of Operational Research Society} 40 (1989) 1129-1135.

\item Dannenbring, D.G.:
An Evaluation of Flow Shop Sequencing Heuristics,
{\em Management Science} 23 (1977) 1174-1182.

\item Dauzere-Peres, S. and Lasserre, J.-B.:
A Modified Shifting Bottleneck Procedure for Job-Shop Scheduling,
{\em International Journal of Production Research} 31 (1993) 923-932.

\item Giffler, B. and Thompson, G.L.:
Algorithms for Solving Production Scheduling Problems,
{\em Operations Research} 8 (1960) 487-503.

\item Ho, J.C.:
Flowshop Sequencing with Mean Flowtime Objective,
{\em European Journal of Operational Research} 81 (1995) 571-578.

\item Ho, J.C. and Chang, Y.-L.:
A New Heuristic for the $n$-Job, $m$0Machine Flow-Shop Problem,
{\em European Journal of Operational Research} 52 (1991) 194-202.

\item Ho, J.C. and Gupta, J.N.D.:
Flowshop Scheduling with Dominant Machines,
{\em Computer and Operations Research} 22 (1995) 237-246.

\item Hundal, T.S. and Rajgopal, J.:
An Extension of Palmer’s Heuristic for the Flow Shop Scheduling Problem,
{\em International Journal of Production Research} 26 (1988) 1119-1124.

\item Jin, Z., Yang, Z. and Ito, T.:
Metaheuristics Algorithms for the Multistage Hybrid Flowshop Scheduling
Problem,
{\em International Journal of Production Reserach} 100 (2006) 322-334.

\item King, J.R. and Spachis, A.S.:
Heuristics for Flow-Shop Scheduling,
{\em International Journal of Production Research} 18 (1980) 345-357.

\item Lahiri, S., Rajendran, C. and Narendran, T.T.:
Evalution of Heuristics for Scheduling in a Flowshop: A Case Study,
{\em Production Planning and Control} 4 (1993) 153-158.

\item Lai, T.-C.:
A Note on Heuristic of Flow-Shop Scheduling,
{\em Operations Research} 44 (1996) 648-652.

\item Liu, J. and Reeves, C.R.:
Constructive and Composite Heuristic Solutions to the $P||\sum C_{i}$ Scheduling Problem,
{\em European Journal of Operational Research} 132 (2001) 439-452.

\item Nawaz, M., Enscore, E.E. and Ham, I.:
A Heuristic Algorithm for the $m$-Machine, $n$-Job Flow-Shop Sequencing Problem,
{\em OMEGA} 11 (1983) 91-95.

\item Nearchou, A.C.:
A Differential Evolution Approach for the Common Due Date Early/Tardy Job Scheduling Problem,
{\em Computers and Operations Research} 35 (2008) 1329-1343.

\item O\v{g}uz, C., Ercan, M.F., Cheng, T.C.E. and Fung, Y.F.:
Heuristic Algorithms for Multiprocessor Task Scheduling in a Two-Stage Hybrid Flowshop,
{\em European Journal of Operational Research} 149 (2003) 390-403.

\item Rajendran, C.:
A Heuristic for Scheduling in Flowshop and Flowline-Based Manufacturing
Cell with Multi-Criteria,
{\em International Journal of Production Research} 32 (1994) 2541-2558.

\item Rajendran, C.:
Heuristic for Scheduling in Flowshop with Multiple Objectives,
{\em European Journal of Operational Research} 82 (1995) 540-555.

\item Rajendran, C. and Chaudhuri, D.:
An Efficient Heuristic Approach to the Scheduling of Jobs in a Flowshop,
{\em European Journal of Operational Research} 61 (1991) 318-325.

\item Rajendran, C. and Ziegler, H.:
Heuristics for Scheduling in a Flowshop with Setup, Processing and Removal Times Separated,
{\em Production Planning and Control} 8 (1997) 568-576.

\item Rajendran, C. and Ziegler, H.:
An Efficient Heuristic for Scheduling in a Flowshop to Minimize Total Weighted Flowtime of Jobs,
{\em European Journal of Operational Research} 103 (1997) 129-138.

\item Reeves, C.R.:
Landscapes, Operators and Heuristic Search,
{\em Annals of Operations Research} 86 (1999) 473-490.

\item Sadeh, N. and Fox, M.S.:
Variable and Value Ordering Heuristic for the Job Shop Scheduling Constraint Satisfaction Problem,
{\em Artificial Intelligence} 86 (1996) 1-41.

\item Stinson, J.P. and Smith, A.W.:
A Heuristic Programming Procedure for Sequencing the Static Flowshop,
{\em International Journal of Production Research} 20 (1982) 753-764.

\item Taillard, E.:
Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem,
{\em European Journal of Operational Research} 47 (1990) 65-74.

\item Turner, S. and Booth, D.:
Comparison of Heuristics for Flow Shop Sequencing,
{\em OMEGA} 15 (1987) 75-85.

\item Woo, H.-S. and Yim, D.-S.:
A Heuristic ALgorithm for Mean Flowtime Objective in Flowshop Scheduling,
{\em Computers and Operations Research} 25 (1998) 175-182.

\item Zhang, C.Y., Li, P.G.,Rao, Y.Q. and Guan, Z.L. :
A Very Fast TS/SA Algorithm for the Job Shop Scheduling Problem,
{\em Computers and Operations Research} 35 (2008) 282-294.

\begin{equation}{\label{p}}\tag{P}\mbox{}\end{equation}

Using Neural Networks.

\item Arizono, I., Yamamoto, A. and Ohta, H.:
Scheduling for Minimizing Total Actual Flow Time by Neural Networks,
{\em International Journal of Production Research} 30 (1992) 503-511.

\item El-Bouri, A., Balakrishnan, S. and Popplewell, N.:
Sequencing Jobs on a Single Machine: A Neural Network Approach,
{\em European Journal of Operational Research} 126 (2000) 474-490.

\item Foo, Y.-P.S. and Takefuji, Y.:
Stochastic Neural Networks for Solving Job-Shop Scheduling: Part 1.
Problem Representation; Part 2. Architecture and Simulations,
{\em Proc. IEEE 2nd Int. Conf. Neural Networks} Vol. II (1988)
275-290.

\item Philipoom, P.R., Wiegmann, L. and Ress, L.P.:
Cost-Based Due-Date Assignment with the Use of Classical Neural-Network
Approaches,
{\em Naval Research Logistics} 44 (1997) 21-46.

\item Sadeh, N., Sycara, K. and Xiong, Y.:
Backtracking Techniques for the Job Shop Scheduling Constraint Stisfaction
Problem,
{\em Artificial Intelligence} 76 (1995) 455-480.

\item Satake, T., Morikawa, K. and Nakamura, N.:
Neural Network Approach for Minimizing the Makespan of the General
Job-Shop,
{\em International Journal of Production Economics} 33 (1994) 67-74.

\item Yang, S. and Wang, D.:
Constraint Satisfaction Adaptive Neural Network and Heuristics Combined
Approaches for Generalized Job-Shop Scheduling,
{\em IEEE Trans. on Neural Network} 11 (2000) 474-486.

\item Yu, H. and Liang, W.:
Neural Network and Genetic Algorithm-Based Hybrid Approach to Expanded
Job-Shop Scheduing,
{\em Computers and Industrical Engineering} 39 (2001) 337-356.

\item Zhou, D.N., Cherkassky, V., Baldwin, T.R. and Plson, D.E.:
A Neural Network Approach to Job-Shop Scheduling,
{\em IEEE Trans. on Neural Networks} 2 (1991) 175-179.

\begin{equation}{\label{q}}\tag{Q}\mbox{}\end{equation}

Complexity in Scheduling Problems.

\item Ahmadi, R.H. and Bagchi, U.:
Improved Lower Bounds for Minimizing the Sum of Completion Times of $n$
Jobs over $m$ Machines in a Flow Shop,
{\em European Journal of Operational Research} 44 (1990) 331-336.

\item Applegate, D. and Cook, W.:
A Computational Study of the Job-Shop Scheduling Problem,
{\em ORSA Journal on Computing} 3 (1991) 149-156.

\item Baker, K.R.:
A Comparative Study of Flow-Shop Algorithms,
{\em Operations Research} 23 (1975) 62-73.

\item Browne, S. and Yechiali, U.:
Scheduling Deteriorating Jobs on a Single Processor,
{\em Operations Research} 38 (1990) 495-498.

\item Chanas, S. and Zieli\'{n}ski, P.:
The Computational Complexity of the Criticality Problems in a Network with
Interval Activity Times,
{\em European Journal of Operational Research} 136 (2002) 541-550.

\item Chen, C.-L. and Bulfin, R.L.:
Complexity of Single Machine, Multi-Criteria Scheduling Problems,
{\em European Journal of Operational Research} 70 (1993) 115-125.

\item Cheng, T.C.E., CHen, Z.-L., Kovalyov, M.Y. and Lin, B.M.T.:
Parallel-Machine Batching and Scheduling to Minimize Total Completion Time,
{\em IIE Transations} 28 (1996) 953-956.

\item Du, J. and Leung, J. Y.-T.:
Minimizing Total Tardiness on One Machine is NP-Hard,
{\em Mathematics of Operations Research} 15 (1990) 483-495.

\item Eck, B.T. and Pinedo, M.:
On the Minimization of the Makespan Subject to Flowtime Optimality,
{\em Operations Research} 41 (1993) 797-801.

\item Garey, M.R., Johnson, D.S. and Sethi, R.:
The Complexity of Flowshop and Jobshop Scheduling,
{\em Mathematics of Operations Research} 1 (1976) 117-129.

\item Geneste, L., Grabot, B. and Letouzey, A.:
Scheduling Uncertain Orders in the Customer-Subcontractor Context,
{\em European Journal of Operational Research} 147 (2003) 297-311.

\item Gonzalez, T. and Sahni, S.:
Flowshop and Jobshop Schedule: Complexity and Approximation,
{\em Operations Research} 26 (1978) 36-52.

\item Kellerer, H. and Strusevich, V.A.:
Scheduling Parallel Dedicated Machines under a Single Non-Shared Resource,
{\em European Journal of Operational Research} 147 (2003) 345-364.

\item Kohler, W.H. and Steiglitz, K.:
Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem $n/2/F/\bar{F}$,
{\em Journal of the Association for Computing Machinery} 22 (1975) 106-114.

\item Lee, C.-Y., Cheng, T.C.E. and Lin, B.M.T.:
Minimizing the Makespan in the $3$-Machine Assembly-Type Flowshop Scheduling Problem,
{\em Management Science} 39 (1993) 616-625.

\item Lin, B.M.T. and Cheng, T.C.E.:
Batch Scheduling in the No-Wait Two-Machine Flowshop to Minimize the Makespan,
{\em Computers and Operations Research} 28 (2001) 613-624.

\item Lin, B.M.T. and Cheng, T.C.E.:
Fabrication and Assembly Scheduling in a Two-Machine Flowshop,
{\em IIE Transactions} 34 (2002) 1015-1020.

\item McCormick, S.T., Pinedo, M.L., Shenker, S. and Wolf, B.:
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time,
{\em Operations Research} 37 (1989) 925-935.

\item Megiddo, N.:
Combinatorial Optimization with Rational Objective Functions,
{\em Mathematics of Operations Research} 4 (1979) 414-424.

\item Oguz, C., Lin, B.M.T. and Cheng, T.C.E.:
Two-Stage Flowshop Scheduling with a Common Second-Stage Machine,
{\em Computers and Operations Research} 24 (1997) 1169-1174.

\item Panwalkar, S.S. and Rajagopalan, R.:
Single-Machine Sequencing with Controllable Processing Times,
{\em European Journal of Operational Research} 59 (1992) 298-302.

\item Sahni, S. and Cho, Y.:
Complexity of Scheduling Shops with No Wait in Process,
{\em Mathematics of Operations Research} 4 (1979) 448-457.

\item Selen, W.J. and Hott, D.D.:
A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop
Scheduling Problem,
{\em Journal of the Operational Research Society} 37 (1986) 1121-1128.

\item Sethi, R.:
On the Complexity of Mean Flow Time Scheduling,
{\em Mathematics of Operations Research} 2 (1977) 320-330.

\item Sun, D. and Lin, L.:
A Dynamic Job Shop Scheduling Framework: A Backward Approach,
{\em International Journal of Production Research} 32 (1994) 967-985.

\item Vickson, R.G.:
Choosing the Job Sequence and Processing Times to Minimize Total Processing
Plus Flow Cost on a Single Machine,
{\em Operations Research} 28 (1980) 1155-1167.

\item Wein, L.M. and Chevalier, P.B.:
A Broader View of the Job-Shop Scheduling Problem,
{\em Management Science} 38 (1992) 1018-1033.

\item Wilson, J.M.:
Alternative Formulation of a Flow-Shop Scheduling,
{\em Journal of the Operational Research Society} 40 (1989) 395-399.

\item Yang, D.-L. and Chern, M.-S.:
A Two-Machine Flowshop Sequencing Problem with Limited Waiting Time
Constraints,
{\em Computers and Industrial Engineering} 28 (1995) 63-70.

\item Yang, D.-L. and Chern, M.-S.:
A Generalized Two-Machine Flowshop Scheduling Problem with Processing
Time Linearly Dependent on Job Waiting-Time,
{\em Computers and Industrial Engineering} 36 (1999) 365-378.

\item Yang, D.-L. and Chern, M.-S.:
Two-Machine Flowshop Group Scheduling Problem,
{\em Computers and Operations Research} 27 (2000) 975-985.

\begin{equation}{\label{r}}\tag{R}\mbox{}\end{equation}

Reviews in Scheduling Problems.

\item Alidaee, B. and Womer, N.K.:
Scheduling with Time Dependent Processing Times: Review and Extensions,
{\em Journal of Operational Research Society} 50 (1999) 711-720.

\item Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T.:
A Review of Scheduling Research Involving Setup Considerations,
{\em Omega} 27 (1999) 219-239.

\item Allahverdi, A., Ng, C.T., Cheng, T.C.E. and Kovalyov, M.Y.:
A Survey of Scheduling Problems with Setup Times or Costs,
{\em European Journal of Operational Research} 187 (2008) 985-1032.

\item Baker, K.R. and Scudder, G.D.:
Sequencing with Earliness and Tardiness Penalities: A Review,
{\em Operations Research} 38 (1990) 22-36.

\item Biskup, D.: (Scheduling with Learning Effects)
A State-of-the-art Review on Scheduling with Learning Effects,
{\em European Journal of Operational Research} 188 (2008) 315-329.

\item Blazewicz, J. and Kobler, D.:
Review of Properties of Different Precedence Graphs for Scheduling Problems,
{\em European Journal of Operational Research} 142 (2002) 435-443.

\item Cheng, T.C.E., Ding, Q. and Lin, B.M.T.:
A Concise Survey of Scheduling with Time-Depedent Processing Times,
{\em European Journal of Operational Research} 152 (2004) 1-13.

\item Cheng, T.C.E. and Sin, C.C.S.:
A State-of-the-Art Review of Paralle-Machine Scheduling Research,
{\em European Journal of Operational Research} 47 (1990) 271-292.

\item Dileepan, P. and Sen, T.:
Bicriterion Static Scheduling Research for a Single Machine,
{\em OMEGA} 16 (1988) 53-59.

\item Gordon, V., Proth, J.-M. and Chu, C.:
A Survey of the State-of-the-Art of Common Due Date Assignment and Scheduling Research,
{\em European Journal of Operational Research} 139 (2002) 1-25.

\item Graves, S.C.:
A Review of Production Scheduling,
{\em Operations Research} 29 (1981) 646-675.

\item Gupta, J.N.D. and Stafford, E.F.:
Flowshop Scheduling Research after Five Decades}
{\em European Journal of Operational Research} 169 (2006) 699-711.

\item Hall, N.G. and Sriskandarajah, C.:
A Survey of Machine Scheduling Problesm with Blocking and No-Wait in Process,
{\em Operations Research} 44 (1996) 510-525.

\item Koulamas, C.:
The Total Tardiness Problem: Review and Extensions,
{\em Operations Research} 42 (1994) 1025-1041.

\item Lauff, V. and Werner, F.:
Scheduling with Common Due Date, Earliness and Tardiness Penalties
for Multimachine Problems: A Survey,
{\em Mathematical and Computer Modelling} 40 (2004) 637-655.

\item Maccarthy, B.L. and Liu, J.:
Addressing the Gap in Scheduling Research: A Review of Optimization and
Heuristic Methods in Production Scheduling,
{\em International Journal of Production Research} 31 (1993) 59-79.

\item Nagar, A., Haddock, J. and Heragu, S.:
Multiple and Bicriteria Scheduling: A Literature Survey,
{\em European Journal of Operational Research} 81 (1995) 88-104.

\item Panwalkar, S.S. and Iskander, W.:
A Survey of Scheduling Rules,
{\em Operations Research} 25 (1977) 45-61.

\item Potts, C.N. and Kovalyov, M.Y.:
Scheduling with Batching: A Review,
{\em European Journal of Operational Research} 120 (2000) 228-249.

\item Ramasesh, R.:
Dynamic Job Shop Scheduling: A Survey of Simulation Research,
{\em Omega} 18 (1990) 43-57.

\item Sen, T. and Gupta, S.K.:
A State-of-Art Survey of Static Scheduling Research Involving Due Dates,
{\em OMEGA} 12 (1984) 63-76.

\item Yang, W.-H. and Liao, C.-J.:
Survey of Scheduling Research Involving Setup Times,
{\em International Journal of Systems Science} 30 (1999) 143-155.

\begin{equation}{\label{s}}\tag{S}\mbox{}\end{equation}

Uncategorized.

\item Abadi, I.N.K., Hall, N.G. and Sriskandarajah, C.:
Minimizing Cycle Time in a Blocking Flowshop,
{\em Operations Research} 48 (2000) 177-180.

\item Chen, H. and Luh, P.B.:
An Alternative Framework to Lagrangian Relaxation Approach for Job Shop Scheduling,
{\em European Journal of Operational Research} 149 (2003) 409-512.

\item Lawler, E.L.:
On Scheduling Problems with Deferral Costs,
{\em Management Science} 11 (1964) 280-288.

\item Lei, L. and Wang, T.J.:
Determining Optimal Cycle Hoist Schedules in a Single-Hoist Electroplating Line,
{\em IIE Transactions} 26 (1994) 25-33.

\item Gupta, J.N.D., Hennig, K. and Werner, F.:
Local Search Heuristics for Two-Stage Flow Shop Problems with Secondary
Criterion,
{\em Computers and Operations Research} 29 (2002) 123-149.

\item Oguz, C., Lin, B.M.T. and Cheng, T.C.E.: (Deterministic Scheduling)
Two-Stage Flowshop Scheduling with a Common Second-Stage Machine,
{\em Computers and Operations Research} 24 (1997) 1169-1174.

\item Yang, W.-H.:
Group Shceduling in a Two-Stage Flowshop,
{\em Journal of the Operational Research Society} 53 (2002) 1367-1373.

\item Burke, E.K., Bykov, Y., Newall, J. and Petrovic, S.: (Timetabling)
A Time-Predefined Local Search Approach to Exam Timetabling Problems,
{\em IIE Transactions} 36 (2004) 509-528.

\item Burke, E.K., Kendall, G. and Soubeiga, E.: (Tabu Search)(Timetabling)
A Tabu Search Hyperheuristics for Timetabling and Rostering,
{\em Journal of Heuristics} 9 (2003) 451-470.

\item Deris, S., Omatu, S., Ohta, H. and Saad, P.:
Incorporating Constraint Propagation in Genetic Algorithm for University
Timetable Planning,
{\em Engineering Applications of Artificial Intelligence} 12 (1999) 241-253.

\item Wright, M.: (Hybrid Methods) (Timetabling)
Subcost-Guided Search — Experiments with Timetabling Problems,
{\em Journal of Heuristics} 7 (2001) 251-260.

Scheduling Problems with Deterioration.

Scheduling Problems with Setup Times.

Scheduling Problems with Learning Effects.

Scheduling Problems with Earliness and Tardiness.

Scheduling Problems with Common Due Date.

Scheduling Problems with Multicriteria.

Group Scheduling Problems.

Fuzzy Scheduling Problems.

Using Genetic Algorithm.

Using Ant Colony Optimization.

Using Artificial Immune System.

Using Branch and Bound.

Using Simulated Annealing.

Using Tabu Search.

Using Heuristic Algorithms.

Using Neural Networks.

Complexity in Scheduling Problems.

Reviews in Scheduling Problems.

Uncategorized.

Hsien-Chung Wu

發佈留言取消回覆

Scheduling Problems with Deterioration.

Scheduling Problems with Setup Times.

Scheduling Problems with Learning Effects.

Scheduling Problems with Earliness and Tardiness.

Scheduling Problems with Common Due Date.

Scheduling Problems with Multicriteria.

Group Scheduling Problems.

Fuzzy Scheduling Problems.

Using Genetic Algorithm.

Using Ant Colony Optimization.

Using Artificial Immune System.

Using Branch and Bound.

Using Simulated Annealing.

Using Tabu Search.

Using Heuristic Algorithms.

Using Neural Networks.

Complexity in Scheduling Problems.

Reviews in Scheduling Problems.

Uncategorized.

Hsien-Chung Wu

相關文章

Theory of Fuzzy Sets

Systems Reliability

Optimization

發佈留言取消回覆