TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES (Q3406723): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+Flowshop scheduling research after five decades
@@ Property / cites work: Flowshop scheduling research after five decades / rank @@
+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 @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling problem to minimize total completion time with random and bounded processing times
+Normal rank