Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855): Difference between revisions

@@ Property / author @@
+Bertrand M. T. Lin
@@ Property / author: Bertrand M. T. Lin / rank @@
+Normal rank
@@ Property / author @@
+Jacek Błażewicz
@@ Property / author: Jacek Błażewicz / rank @@
+Normal rank
@@ 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.1016/j.ejor.2021.07.055
+Normal rank
@@ Property / OpenAlex ID @@
+W3193438168
@@ Property / OpenAlex ID: W3193438168 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q115198388
@@ Property / Wikidata QID: Q115198388 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680271
@@ Property / cites work: Q3680271 / rank @@
+Normal rank
@@ Property / cites work @@
+Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
+Normal rank
@@ Property / cites work @@
+Q2712360
@@ Property / cites work: Q2712360 / rank @@
+Normal rank
@@ Property / cites work @@
+Open shop scheduling problems with late work criteria.
+Normal rank
@@ Property / cites work @@
+KI 2005: Advances in Artificial Intelligence
@@ Property / cites work: KI 2005: Advances in Artificial Intelligence / rank @@
+Normal rank
@@ Property / cites work @@
+The two-machine flow-shop problem with weighted late work criterion and common due date
+Normal rank
@@ Property / cites work @@
+Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling on two identical machines with a common due date to maximize total early work
+Normal rank
@@ Property / cites work @@
+Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
+Normal rank
@@ Property / cites work @@
+Scheduling on parallel identical machines with late work criterion: offline and online cases
+Normal rank
@@ Property / cites work @@
+Two-machine flow-shop scheduling to minimize total late work: revisited
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A common approximation framework for early work, late work, and resource leveling problems
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling a single machine to minimize total late work
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling to Minimize Total Late Work
+Normal rank
@@ Property / cites work @@
+A survey on offline scheduling with rejection
@@ Property / cites work: A survey on offline scheduling with rejection / rank @@
+Normal rank
@@ Property / cites work @@
+Mirror scheduling problems with early work and late work criteria
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
+Normal rank
@@ Property / cites work @@
+Two‐agent scheduling with linear resource‐dependent processing times
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
+Normal rank
@@ Property / cites work @@
+An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
+Normal rank
@@ Property / cites work @@
+Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
+Normal rank