The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331931003657691
+Normal rank
@@ Property / OpenAlex ID @@
+W2022805676
@@ Property / OpenAlex ID: W2022805676 / rank @@
+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 @@
+Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
+Normal rank
@@ Property / cites work @@
+Executing production schedules in the face of uncertainties: a review and some future directions
+Normal rank
@@ Property / cites work @@
+A new sufficient condition of optimality for the two-machine flowshop problem
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Sequencing with uncertain numerical data for makespan minimisation
+Normal rank
@@ Property / cites work @@
+Mean flow time minimization with given bounds of processing times
+Normal rank
@@ Property / cites work @@
+Necessary and sufficient conditions of optimality for some classical scheduling problems
+Normal rank
@@ Property / cites work @@
+Schedule execution for two-machine flow-shop with interval processing times
+Normal rank
@@ Property / cites work @@
+A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling problem to minimize total completion time with random and bounded processing times
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted flow time of a set of jobs with interval processing times
+Normal rank