Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are concerned with the problem of safely storing a history of actions that happen rapidly in real time, such as in buy and sell orders in stock exchange trading. This leads to a single-family scheduling problem with batching on a single machine, with a setup time and job release times, under batch availability.  investigate the objective of minimizing the total flow time in an online setting. On the positive side,  propose a 2-competitive algorithm for the case of identical job processing times, and  prove a lor bound that comes close. With general processing times, our lor bound shows that online algorithms are inevitably bad in the worst case.
['Beat Gfeller', 'Leon Peeters', 'Birgitta Weber', 'Peter Widmayer']
I am writing a research paper on a idea Online single machine batch scheduling
[{"from": "human", "value": "I am writing a research paper on a idea Online single machine batch scheduling"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are concerned with the problem of safely storing a history of actions that happen rapidly in real time, such as in buy and sell orders in stock exchange trading. This leads to a single-family scheduling problem with batching on a single machine, with a setup time and job release times, under batch availability.  investigate the objective of minimizing the total flow time in an online setting. On the positive side,  propose a 2-competitive algorithm for the case of identical job processing times, and  prove a lor bound that comes close. With general processing times, our lor bound shows that online algorithms are inevitably bad in the worst case."}]