@article {1492,
	title = {BATCH SEQUENCING},
	journal = {IIE Transactions},
	volume = {24},
	year = {1992},
	pages = {73-83},
	abstract = {<p>Consider the single machine scheduling problem where there are a number of part types to be processed. A part type is defined as follows: Two parts are of the same part type if the machine does not require a setup in between the processing of these parts. The problem investigated in this paper is to find a sequence of batches of parts (if there are any) where all the requirements for parts are met. A heuristic and an exact algorithm are developed, and computational analysis is performed to measure the performance of the heuristic. The time complexity function of the heuristic is O(n2), and the exact algorithm runs in polynomial time given a fixed upper bound on the number of setups.</p>},
	doi = {10.1080/07408179208964235},
	url = {https://doi.org/10.1080/07408179208964235},
	author = {Ali Tamer {\"U}nal and Ali S. Kiran}
}
@article {1491,
	title = {A location problem on unicyclic networks: Balanced case},
	journal = {European Journal of Operational Research},
	volume = {62},
	year = {1992},
	pages = {194-202},
	abstract = {<p>The problem of locating n stations on a unicyclic unidirectional network is considered. We formulated the problem as an integer program for the case of a balanced flow matrix, i.e., the total inflow to a station equals the total outflow from that station. The integer programming formulation reduces the problem to a station sequencing problem regardless of the actual station locations on the network. Furthermore, the empirical evidence suggests that the LP solutions to the relaxed IP formulations are optimal.</p>},
	issn = {0377-2217},
	doi = {https://doi.org/10.1016/0377-2217(92)90247-7},
	url = {https://www.sciencedirect.com/science/article/pii/0377221792902477},
	author = {Ali S. Kiran and Ali Tamer {\"U}nal and Selcuk Karabati}
}
