Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

DOI10.1016/S0377-2217(99)00447-6zbMath0979.90029MaRDI QIDQ5937351

J. I. Min, Chang Sup Sung

Publication date: 12 July 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingearlinessflowshopbatch processing machinetardiness

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items

Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs, Two-machine flow shop scheduling with two criteria: maximum earliness and makespan, Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon, Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date, Integrated scheduling on a batch machine to minimize production, inventory and distribution costs, Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey, A note on a due-date assignment on a two-machine flow-shop, Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Flowshop-scheduling problems with makespan criterion: a review, A survey of scheduling with parallel batch (p-batch) processing, A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs, Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
• A note on one-processor scheduling with asymmetric earliness and tardiness penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Scheduling job families about an unrestricted common due date on a single machine
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Scheduling Groups of Jobs on a Single Machine