Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Adiri, 1989, Single machine flow-time scheduling with a single breakdown, Acta Inform., 26, 679, 10.1007/BF00288977 Baker, 1995 Dudek, 1992, The lessons of flowshop scheduling research, Oper. Res., 40, 7, 10.1287/opre.40.1.7 Garey, 1979 Garey, 1976, The complexity of flowshop and jobshop scheduling, Math. Oper. Res., 1, 117, 10.1287/moor.1.2.117 Hall, 1994, A polynomial approximation scheme for a constrained flowshop scheduling problem, Math. Oper. Res., 19, 68, 10.1287/moor.19.1.68 Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Res. Logist. Quart., 1, 61, 10.1002/nav.3800010110 Lee, 1991, Parallel machines scheduling with non-simultaneous machine available time, Discrete Appl. Math., 30, 53, 10.1016/0166-218X(91)90013-M Lee, 1995, Machine scheduling with an availability constraint Lee, 1996, Machine scheduling with an availability constraint, J. Global Optimization, 9, 395, 10.1007/BF00121681 Lee, 1992, Single machine flow-time scheduling with scheduled maintenance, Acta Inform., 29, 375, 10.1007/BF01178778 Lee, 1993, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Appl. Math., 41, 211, 10.1016/0166-218X(90)90055-H Lee, 1994, Minimizing makespan in hybrid flowshops, Oper. Res. Lett., 16, 149, 10.1016/0167-6377(94)90026-4 Mosheiov, 1994, Minimizing the sum of job completion times on capacitated parallel machines, Math. Comput. Modelling, 20, 91, 10.1016/0895-7177(94)90024-8 Pinedo, 1995 Potts, 1985, Analysis of heuristics for two-machine flow-shop sequencing subject to release dates, Math. Oper. Res., 10, 576, 10.1287/moor.10.4.576 Schmidt, 1988, Scheduling independent tasks with deadlines on semi-identical processors, J. Oper. Res. Soc., 39, 271, 10.1057/jors.1988.44