Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.camwa.2010.06.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2081821125
@@ Property / OpenAlex ID: W2081821125 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
+Normal rank
@@ Property / cites work @@
+Schedule execution for two-machine flow-shop with interval processing times
+Normal rank
@@ Property / cites work @@
+Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling problem to minimize total completion time with random and bounded processing times
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
+Normal rank
@@ Property / cites work @@
+A survey of scheduling problems with setup times or costs
+Normal rank
@@ Property / cites work @@
+Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
+Normal rank