A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs (Q733523): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2009.03.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2072723821
@@ Property / OpenAlex ID: W2072723821 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with time dependent processing times: Review and extensions
+Normal rank
@@ Property / cites work @@
+A concise survey of scheduling with time-dependent processing times
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039929
@@ Property / cites work: Q4039929 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hard cases in scheduling deteriorating jobs on dedicated machines
+Normal rank
@@ Property / cites work @@
+Complexity analysis of job-shop scheduling with deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time in a two-machine flow shop with deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Flow shop scheduling problems with deteriorating jobs under dominating machines
+Normal rank